Matching.Vf Class Reference

Implémente l'algorithme VF de Cordella servant à déterminer l'isomorphisme entre deux graphes. More...

Inheritance diagram for Matching.Vf:

Public Member Functions
	Vf ()
	Constructeur qui initialise toutes les listes More...
List< string[]>	GraphMatching (Graph g1, Graph g2, int Kvalue=0)
	Return the list of matched node result of the VF 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...
void	printLists ()
	Fonction de test permettant d'afficher l'état des listes More...

Properties
ResultIsomorphism	IsoResult [get, set]

Detailed Description

Implémente l'algorithme VF de Cordella servant à déterminer l'isomorphisme entre deux graphes.

Constructor & Destructor Documentation

Matching.Vf.Vf

(

)

Constructeur qui initialise toutes les listes

Member Function Documentation

List<string[]> Matching.Vf.GraphMatching	(	Graph	g1,
		Graph	g2,
		int	Kvalue = 0
	)

Return the list of matched node result of the VF test

Parameters

g1	Graph 1
g2	Graph 2
Kvalue	unused value

Returns

List of matched node

Implements Graphs.IGraphMatching.

bool Matching.Vf.isIsomorphism	(	Graph	g1,
		Graph	g2
	)

Graph isomorphism test between g1 and g2

Parameters

g1	Graph 1
g2	Graph 2

Returns

True if g1 and g2 are isomorph

Implements Graphs.IIsomorphism.

bool Matching.Vf.isSubGraphIsomorphism	(	Graph	g1,
		Graph	g2
	)

SubGraph isomorphism test between g1 and g2

Parameters

g1	Graph 1
g2	Graph 2

Returns

True if g1 and g2 are isomorph

Implements Graphs.ISubGraphIsomorphism.

void Matching.Vf.printLists

(

)

Fonction de test permettant d'afficher l'état des listes

---

The documentation for this class was generated from the following file:

• D:/Documents/Polytech/5ème_année/PFE/Dépôt_Projet/GraphMatchingSeb/GraphMatching/Matching/Vf.cs