Apply a graph pattern matching algorithm to find subgraphs of data graph 'g' that isomorphically match query graph 'q'.
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 bijective functions {'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 the mappings from the query graph 'q' to the data graph 'g'.
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 'phi' that maps each query graph vertex 'u' to a set of 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.
Print the elapsed time in milliseconds (ms) for the execution of an arbitrary block of code: 'time { block }'.
Print the elapsed time in milliseconds (ms) for the execution of an arbitrary block of code: 'time { block }'.
the block of code to be executed
http://stackoverflow.com/questions/9160001/how-to-profile-methods-in-scala
The 'PatternMatcher' abstract class serves as a template for implementing specific algorithms for graph pattern matching.