![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | Graph GML parser |
![]() ![]() ![]() | Graph GML writer |
![]() ![]() ![]() | Graph GML parser |
![]() ![]() ![]() | Graph gSpan writer |
![]() ![]() ![]() | Graph GXL writer |
![]() ![]() ![]() | Interface graph storage |
![]() ![]() ![]() | Stores new graph pointers in STL push-back container |
![]() ![]() ![]() | Graph storage within STL push-back container |
![]() ![]() ![]() | Unique storage of new graph pointers in STL push-back container |
![]() ![]() ![]() | Unique storage of graphs in STL push-back container |
![]() ![]() ![]() | Graph storage within output stream |
![]() ![]() ![]() | Rule left side pattern |
![]() ![]() ![]() | Graph Grammar Rule application for each reported match |
![]() ![]() ![]() | Rule right side graph |
![]() ![]() ![]() | |
![]() ![]() ![]() | Rule consistency codes |
![]() ![]() ![]() | Rule parsing error |
![]() ![]() ![]() | Graph grammar rule parser |
![]() ![]() ![]() | Rule GML writer |
![]() ![]() ![]() | Graph grammar rule parser |
![]() ![]() | |
![]() ![]() ![]() | VF2 graph isomorphism |
![]() ![]() ![]() | Graph_Interface wrapper for boost graphs |
![]() ![]() ![]() | Graph_Interface wrapper for set of boost graphs |
![]() ![]() ![]() | Interface of graphs for graph matching |
![]() ![]() ![]() | Interface graph isomorphism |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | Interface graph match reporting |
![]() ![]() ![]() | Interface edge match constraint |
![]() ![]() ![]() | Constrains edge labels within a match |
![]() ![]() ![]() | Interface node match constraints |
![]() ![]() ![]() | Constrains a node's adjacency for a match |
![]() ![]() ![]() | Constrains a node's labels for a matching |
![]() ![]() ![]() | Forbids an edge within a match |
![]() ![]() ![]() | Counts matches |
![]() ![]() ![]() | |
![]() ![]() ![]() | Stores each match in an STL container |
![]() ![]() ![]() | Writes each match to an output stream |
![]() ![]() ![]() | Symmetry breaking among matches |
![]() ![]() ![]() | Ports NSPDK functionality to SGM |
![]() ![]() ![]() | Order based automorphism exclusion |
![]() ![]() ![]() | |
![]() ![]() ![]() | Automorphism description for patterns |
![]() ![]() ![]() | Pattern description to be matched |
![]() ![]() ![]() | Interface ring enumeration |
![]() ![]() ![]() | Interface to report found rings |
![]() ![]() ![]() | Ring enumeration ala Hanser et al |
![]() ![]() ![]() | VF2-based subgraph matching |
![]() ![]() ![]() | Subgraph of a Graph_Interface for matching |
![]() ![]() ![]() | Interface for subgraph monomorphism |
![]() ![]() ![]() | |
![]() ![]() ![]() | General VF2-matching functionalities |