Characterization of 2-Path Signed Network

Algorithm 1

An algorithm to detect and collect P pairs.

	Input: Adjacency matrix and dimension .
	Output: Array which has all collection of P pair and array which has pair of vertices which are not pairs.
	Process:
(1)	Enter the order and adjacency matrix for the signed network
(2)	for to do
(3)	; ,
(4)	; ;
(5)	for to do
(6)	for to do
(7)	fordo
(8)	if () then
(9)	ifthen
(10)	;
(11)	;
(12)	fordo
(13)	fordo
(14)	ifthen
(15)	fordo
(16)	ifthen
(17)	;
(18)	;
(19)	for, do
(20)	for to , do
(21)	ifthen
(22)	;
(23)	;