Matching.GraphEditDistance Class Reference

Inheritance diagram for Matching.GraphEditDistance:

Public Member Functions
	GraphEditDistance ()
	Basic Constructor More...
double	GraphDistance (Graph g1, Graph g2, int Kvalue=0)
	Return the distance between two graphs More...
List< string[]>	GraphMatching (Graph g1, Graph g2, int Kvalue=0)
	Return the node matching between two graphs More...
EditPath	EditDistance (Graph _Graph1, Graph _Graph2)
	Calculate the EditPath between two graphs by means of graph edit distance algorithm. The EditPath contains every node and edge operations to change Graph1 into Graph2. More...

Properties
EditPath	DistanceResult [get, set]

Constructor & Destructor Documentation

Matching.GraphEditDistance.GraphEditDistance

(

)

Basic Constructor

Member Function Documentation

EditPath Matching.GraphEditDistance.EditDistance	(	Graph	_Graph1,
		Graph	_Graph2
	)

Calculate the EditPath between two graphs by means of graph edit distance algorithm. The EditPath contains every node and edge operations to change Graph1 into Graph2.

Parameters

_Graph1	Graph1
_Graph2	Graph2

Returns

EditPath to change Graph1 into Graph2

double Matching.GraphEditDistance.GraphDistance	(	Graph	g1,
		Graph	g2,
		int	Kvalue = 0
	)

Return the distance between two graphs

Parameters

g1	Graph 1
g2	Graph 2
Kvalue	Unused param for Edit Distance

Returns

Distance between Graph 1 and Graph 2

Implements Graphs.IGraphDistance.

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

Return the node matching between two graphs

Parameters

g1	Graph 1
g2	Graph 2
Kvalue	Unused param for Edit Distance

Returns

List of matched node Id

Implements Graphs.IGraphMatching.

---

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/GraphEditDistance.cs