|
GraphLib
2.0
une librairie C# pour l’exploitation de graphes en reconnaissance des formes
|
Implémentation de l'algorithme de Corneil et Gotlieb permettant de savoir si un graphe est isomorphe ou sous-graphe d'un autre. More...
Public Member Functions | |
| IsomorphismCandG () | |
| Constructeur More... | |
| List< String[]> | GraphMatching (Graph g1, Graph g2, int Kvalue=0) |
| Return the list of matched node result of the Corneil & Gotlieb test More... | |
| bool | isIsomorphism (Graph g1, Graph g2) |
| Graph isomorphism test between g1 and g2 More... | |
| bool | isSubGraphIsomorphism (Graph g1, Graph g2) |
| SubGraph isomorphism test between g1 and g2 More... | |
| int | resultDeep () |
| Return the deep of the search More... | |
Properties | |
| ResultIsomorphism | IsoResult [get, set] |
Implémentation de l'algorithme de Corneil et Gotlieb permettant de savoir si un graphe est isomorphe ou sous-graphe d'un autre.
| Matching.IsomorphismCandG.IsomorphismCandG | ( | ) |
Constructeur
Return the list of matched node result of the Corneil & Gotlieb test
| g1 | Graph 1 |
| g2 | Graph 2 |
| Kvalue | unused value |
Implements Graphs.IGraphMatching.
Graph isomorphism test between g1 and g2
| g1 | Graph 1 |
| g2 | Graph 2 |
Implements Graphs.IIsomorphism.
SubGraph isomorphism test between g1 and g2
| g1 | Graph 1 |
| g2 | Graph 2 |
Implements Graphs.ISubGraphIsomorphism.
| int Matching.IsomorphismCandG.resultDeep | ( | ) |
Return the deep of the search