The Hermitian Kirchhoff Index and Robustness of Mixed Graph

Algorithm 1

The positive walk algorithm.

	Input: The adjacency matrix
	Output: The Hermitian adjacency matrix
(1)	Let be a null matrix
(2)	Let
(3)	Let .
(4)	Randomly select an element of for
(5)	for each in do
(6)	Randomly select an element of for
(7)	for each in do
(8)	if and then
(9)
(10)	Randomly select an element of for
(11)	end if
(12)	end for
(13)	end for
(14)