face="Verdana, Arial, Helvetica, sans-serif">Step – 2: Construct its corresponding Square Matrix
Step – 3: Let us consider another Flow Graph as an example
Step – 4: Construct its corresponding Square Matrix
It may be noted that if there are several links between two nodes then " + " sign denotes a parallel link.
This is, however, not very useful. Hence we assign a weight to each entry of the graph matrix.
We use '1' to denote that the edge is present and '0' to indicate its absence. Such a matrix is known as a connection matrix.
For above figure connection matrix can be shown as under.
Step – 5: Compute it's V(G) & draw the matrix again for the same
i.e., we sum each row of the above matrix. Then, we subtract "1" from each row. We, then, add this result or column of result and add "1" to it.
This gives us V(G).
For above matrix we get V(G) = 2.
Many more Articles & Tutorials on White Box Testing