DualSim
The DualSim class provides an implementation for Dual Graph Simulation. It differs from other algorithms by not using inverse adjacency sets (pa) in order to save space.
Value parameters
- g
-
the data graph G(V, E, l)
- q
-
the query graph Q(U, D, k)
Attributes
- Graph
-
- Supertypes
Members list
Value members
Concrete methods
Given the mappings φ produced by the feasibleMates method, eliminate mappings u -> v when (1) v's children fail to match u's or (2) v's parents fail to match u's. This version checks edge labels.
Given the mappings φ produced by the feasibleMates method, eliminate mappings u -> v when (1) v's children fail to match u's or (2) v's parents fail to match u's. This version checks edge labels.
Value parameters
- φ
-
array of mappings from a query vertex u to { graph vertices v }
Attributes
Given the mappings φ produced by the feasibleMates method, eliminate mappings u -> v when (1) v's children fail to match u's or (2) v's parents fail to match u's. This version ignores edge labels.
Given the mappings φ produced by the feasibleMates method, eliminate mappings u -> v when (1) v's children fail to match u's or (2) v's parents fail to match u's. This version ignores edge labels.
Value parameters
- φ
-
array of mappings from a query vertex u to { graph vertices v }
Attributes
- See also
Inherited methods
Apply a graph pattern matching algorithm to find subgraphs of data graph g that isomorphically match query graph q. These are represented by a set of single-valued bijections {psi} where each psi function maps each query graph vertex u to a data graph vertices v.
Apply a graph pattern matching algorithm to find subgraphs of data graph g that isomorphically match query graph q. These are represented by a set of single-valued bijections {psi} where each psi function maps each query graph vertex u to a data graph vertices v.
Attributes
- Inherited from:
- GraphMatcher
Count the number of mappings between query graph vertices u_i and their sets of data graph vertices {v}, giving the number of distinct vertices and edges.
Count the number of mappings between query graph vertices u_i and their sets of data graph vertices {v}, giving the number of distinct vertices and edges.
Value parameters
- φ
-
the set-valued mapping function
Attributes
- Inherited from:
- GraphMatcher
Create an initial array of feasible mappings φ 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 φ from each query vertex u to the corresponding set of data graph vertices {v} whose label matches u's.
Attributes
- Inherited from:
- GraphMatcher
Filter the data graph by consider only those vertices and edges which are part of feasible matches after performing initial dual simulation. Note, used by strict and tight simulation.
Filter the data graph by consider only those vertices and edges which are part of feasible matches after performing initial dual simulation. Note, used by strict and tight simulation.
Value parameters
- φ
-
mappings from a query vertex u_q to { graph vertices v_g }
Attributes
- Inherited from:
- GraphMatcher
Apply a graph 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 φ that maps each query graph vertex u to a set of data graph vertices {v}.
Apply a graph 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 φ that maps each query graph vertex u to a set of data graph vertices {v}.
Value parameters
- ignoreEdgeLabels
-
whether to ingore edge labels during matching
Attributes
- Inherited from:
- GraphMatcher
Show all mappings between query graph vertices u_i and their sets of data graph vertices {v}.
Show all mappings between query graph vertices u_i and their sets of data graph vertices {v}.
Value parameters
- φ
-
the set-valued mapping function
Attributes
- Inherited from:
- GraphMatcher
Test the Graph Pattern Matcher.
Test the Graph Pattern Matcher.
Value parameters
- ans
-
the correct answer
- ignore
-
whether to ignore the edge labels during matching
- mName
-
the name of graph pattern matcher
Attributes
- Inherited from:
- GraphMatcher
Inherited fields
Attributes
- Inherited from:
- GraphMatcher
Attributes
- Inherited from:
- GraphMatcher
Attributes
- Inherited from:
- GraphMatcher
Attributes
- Inherited from:
- GraphMatcher
Attributes
- Inherited from:
- GraphMatcher