Sub-graph search implementation in C#

Given an undirected graph? G(V,E) ,? and having? ? a vertex and edge distance functions D(V) D(E) find? all occurrences of sub-graph K(V,E)? in graph G(V,E), using one of statistical methods and evaluate probability.?

The V and E are designate? some generic type of data. V is for the vertex and E is for the edge of the graph. Example of V could be a surface point? (X,Y) or point in 3D space (X,Y,Z) or some other type of vector data (x1,x2, x3, x4 … Xn). E is similar to V, and may be represented by some other vector, or just a simple value, such as edge weight. Distance functions D(V) and D(E) are used to calculate the distance between the vertexes and edges, and assumed are given . For instance, if V is a vector then distance D(V) may be Euclidian , Menshkovski? or any other function of your choice, calculating numerical value, representing distance between the vectors.? If E is a simple? edge’s weight then distance function could be as simple as absolute distance |X1-Y1|.

The final solution must be implemented in the C# generics, so types? V and E are defined by the end user, as well as the user will define distance functions D(V) or D(E), by implementation of? simple generic interface:

? ? ? public interface IDistanceFunction<T>

? ? ? {

? ? ? ? ? ? ? double GetDistance(T value1, T value2);

? ? ? }

?

## Deliverables

1) Provide Unit tests with the implementation showing correct sub-graphs found in the more complex one.

Μηχανολογία MySQL PHP Αρχιτεκτονική Λογισμικού Δοκιμή Λογισμικού

Ταυτότητα Εργασίας: #3837366

Σχετικά με την εργασία