- a -

• addDeletion() : Matching.EditPath
• addEdge() : Graphs.Graph
• addGraph() : Matching.SearchTree
• addInsertion() : Matching.EditPath
• addNode() : Graphs.Graph
• addSubstitution() : Matching.EditPath
• AttributeGXL() : Graphs.AttributeGXL
• attributesToLabelTree() : Matching.SearchTree

- b -

• BeamSearch() : Matching.BeamSearch

- c -

• calculateAdjacencyMatrix() : Graphs.Graph
• calculateListLabels() : Matching.SearchTree
• calculateMatrixLabel() : Matching.SearchTree
• Combinations() : Matching.Combinations< T >
• compareDegree() : Graphs.Node

- d -

• deleteEdge() : Graphs.Graph
• deleteNode() : Graphs.Graph
• deleteNodeAndEdges() : Graphs.Graph
• Dispose() : Matching.Combinations< T >.Enumerator , Matching.Permutations< T >.Enumerator , Matching.Variations< T >.EnumeratorWithRepetition , Matching.Variations< T >.EnumeratorWithoutRepetition
• dissimilarity() : Graphs.UnLabelNode , Graphs.GenericLabel , Matching.Labels , Graphs.UnLabelEdge , Graphs.Label
• DividePrimeFactors() : Matching.SmallPrimeUtility
• DynamicCastLabel() : Graphs.Graph

- e -

• Edge() : Graphs.Edge
• EditDistance() : Matching.BeamSearch , Matching.GraphEditDistance
• EditPath() : Matching.EditPath
• Enumerator() : Matching.Permutations< T >.Enumerator , Matching.Combinations< T >.Enumerator
• EnumeratorWithoutRepetition() : Matching.Variations< T >.EnumeratorWithoutRepetition
• EnumeratorWithRepetition() : Matching.Variations< T >.EnumeratorWithRepetition
• EvaluatePrimeFactors() : Matching.SmallPrimeUtility

- f -

• Factor() : Matching.SmallPrimeUtility
• findEdge() : Graphs.Graph
• findNode() : Graphs.Graph
• fromAttributes() : Graphs.Label , Graphs.GenericLabel , Matching.Labels , Graphs.UnLabelEdge , Graphs.UnLabelNode

- g -

• GetEnumerator() : Matching.Combinations< T > , Matching.Permutations< T > , Matching.Variations< T >
• Graph() : Graphs.Graph
• GraphDistance() : Matching.BeamSearch , Matching.GraphEditDistance
• GraphEditDistance() : Matching.GraphEditDistance
• GraphMatching() : Matching.GraphEditDistance , Matching.BeamSearch , Matching.Vf , Matching.IsomorphismCandG

- i -

• isIsomorphism() : Matching.IsomorphismCandG , Matching.Vf
• IsomorphismCandG() : Matching.IsomorphismCandG
• isSubGraphIsomorphism() : Matching.IsomorphismCandG , Matching.Vf

- l -

• loadGXL() : Graphs.IOGraph

- m -

• MoveNext() : Matching.Combinations< T >.Enumerator , Matching.Permutations< T >.Enumerator , Matching.Variations< T >.EnumeratorWithoutRepetition , Matching.Variations< T >.EnumeratorWithRepetition
• MultiplyPrimeFactors() : Matching.SmallPrimeUtility

- n -

• Node() : Graphs.Node

- p -

• Permutations() : Matching.Permutations< T >
• printEdgeOperations() : Matching.EditPath
• printLists() : Matching.Vf
• printNodeOperations() : Matching.EditPath

- r -

• Reset() : Matching.Combinations< T >.Enumerator , Matching.Permutations< T >.Enumerator , Matching.Variations< T >.EnumeratorWithoutRepetition , Matching.Variations< T >.EnumeratorWithRepetition
• resultDeep() : Matching.IsomorphismCandG
• ResultIsomorphism() : Matching.ResultIsomorphism

- s -

• saveToGXL() : Graphs.IOGraph
• SearchTree() : Matching.SearchTree

- t -

• toAttributes() : Graphs.GenericLabel , Graphs.Label , Graphs.UnLabelNode , Matching.Labels , Graphs.UnLabelEdge
• toString() : Graphs.GenericLabel , Graphs.UnLabelNode , Matching.Labels , Graphs.Label , Graphs.UnLabelEdge

- v -

• Variations() : Matching.Variations< T >
• Vf() : Matching.Vf