Research Article
The Hermitian Kirchhoff Index and Robustness of Mixed Graph
Algorithm 2
The directed transversal algorithm.
| Input: The mixed graph | | Output: Edge set | (1) | Random select an edge of the mixed graph | (2) | Obtain the Hermitian resistance matrix of | (3) | Calculate the and initialize | (4) | for each edge do | (5) | remove from | (6) | calculate | (7) | ifthen | (8) | | (9) | | (10) | else | (11) | ifthen | (12) | | (13) | end if | (14) | end if | (15) | end for |
|