Figure 5

A simple example is shown to illustrate how breadth-first search method works. Given a network G, first label all the nodes of G and get its parent index. Then generate paths starting from a root node. The nodes with shorter distance to the root node are explored preferentially. Paths starting from root to target are returned when all the nodes are visited. In the network below, take A as the root node and E, F as target nodes. The resulting path sets are {A,B,E}, {A,C,E}, {A,B,C,E}, {A,C,F}, {A,D,F}, {A,C,D,F}, {A,B,C,F} and {A, B,C,D,F}.