Fig. 4
From: HyGraph: a subgraph isomorphism algorithm for efficiently querying big graph databases
A sample execution for the query graph and graph database given in Fig. 1. Each level of the diagram represents the candidate relationship search for edge matching. At the rectangle boxes of each level the found candidates are shown in dashed lines whereas the already matched nodes and relationships are shown in non-dashed lines. At each rectangle box, operations in query part and database part of the reciprocal node branching process are shown in left and right parts of the box, respectively. The execution flows in the arrow direction