# graph matching algorithm(s)
- gmatch(pattern, reference)
- Match pattern graph to reference graph.
Pattern matches are subgraphs of reference (subgraph isomorphisms).
(a subgraph is a subset of variables and subset of edges)
Any vertices in the pattern that are equal to some vertex in reference, they are matched exactly.
Otherwise, vertices in pattern are considered variables.
Returns a list of solutions.
Each solution is a Map from pattern vertices to reference vertices (and vice versa).