Home | Trees | Indices | Help |
---|
|
An implementation of VF2 algorithm for graph ismorphism testing, as seen here:
- Luigi P. Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento,
- "A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 10, pp. 1367-1372, Oct., 2004.
Modified to handle undirected graphs. Modified to handle multiple edges.
Date: $Date: 2007-08-21 16:49:09 -0600 (Tue, 21 Aug 2007) $
|
|||
GraphMatcher A GraphMatcher is responsible for matching undirected graphs (Graph or XGraph) in a predetermined manner. |
|||
DiGraphMatcher A DiGraphMatcher is responsible for matching directed graphs (DiGraph or XDiGraph) in a predetermined manner. |
|||
GMState This class is used internally by the GraphMatcher class. |
|||
DiGMState This class is used internally by the DiGraphMatcher class. |
|
|||
|
|
|||
__credits__ =
|
|||
__revision__ =
|
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0beta1 on Sun Aug 17 12:04:44 2008 | http://epydoc.sourceforge.net |