Examples of mxGraphAnalysis

A singleton class that provides algorithms for graphs. Assume these variables for the following examples:

 mxICostFunction cf = mxDistanceCostFunction(); Object[] v = graph.getChildVertices(graph.getDefaultParent()); Object[] e = graph.getChildEdges(graph.getDefaultParent()); mxGraphAnalysis mga = mxGraphAnalysis.getInstance();

Shortest Path (Dijkstra)

For example, to find the shortest path between the first and the second selected cell in a graph use the following code:

Object[] path = mga.getShortestPath(graph, from, to, cf, v.length, true);

Minimum Spanning Tree

This algorithm finds the set of edges with the minimal length that connect all vertices. This algorithm can be used as follows:

Prim

mga.getMinimumSpanningTree(graph, v, cf, true))

Kruskal

mga.getMinimumSpanningTree(graph, v, e, cf))

Connection Components

The union find may be used as follows to determine whether two cells are connected: boolean connected = uf.differ(vertex1, vertex2). @see mxICostFunction