Apply the Dual Subgraph Isomorphism algorithm to find subgraphs of data graph 'g' that isomorphically match query graph 'q'.
Apply the Dual Subgraph Isomorphism algorithm to find subgraphs of data graph 'g' that isomorphically match query graph 'q'. These are represented by a set of single-valued bijective functions {'psi'} where each 'psi' function maps each query graph vertex 'u' to a data graph vertices 'v'.
Create an initial array of feasible mappings 'phi' from each query vertex 'u' to the corresponding set of data graph vertices '{v}' whose label matches 'u's.
Create an initial array of feasible mappings 'phi' from each query vertex 'u' to the corresponding set of data graph vertices '{v}' whose label matches 'u's.
Get the count of the number of matches.
Apply the Dual Subgraph Isomorphism pattern matching algorithm to find the mappings from the query graph 'q' to the data graph 'g'.
Apply the Dual Subgraph Isomorphism pattern matching algorithm to find the mappings from the query graph 'q' to the data graph 'g'. These are represented by a multi-valued function 'phi' that maps each query graph vertex 'u' to a set of data graph vertices '{v}'.
The
DualIso
class provides an implementation for Subgraph Isomorphism that uses Dual Graph Simulation for pruning.