yFiles Tutorial Graph Algorithm Demos

The following graph algorithmic demos are in this package:

Class Description
demo.algo.CyclesTestTests consistency and performance of two different cycle detection mechanisms provided by yFiles for Java.
demo.algo.GraphConnectivityTestCompares performance and results of some graph connectivity algorithms available in yFiles for Java.
demo.algo.SpanningTreeTestCompares performance of minimum spanning tree algorithms available in yFiles for Java.
demo.algo.ShortestPathTestCompares performance and results of some shortest path algorithms available in yFiles for Java.
demo.algo.ShortestPathDemoDemonstrates how to use a Shortest Path Algorithm.
demo.algo.TopologicalTestCompares different methods that calculate a topological node ordering on the nodes of an acyclic graph.
demo.algo.TopologicalSortDemoDemonstrates how to implement a topological sort algorithm using depth-first search.

Running the Demos

From Within an IDE

Set <yFilesDir>/src as your source directory. Then add <yFilesDir>/lib/y.jar and the source folder <yFilesDir>/src to your classpath. Now you should be ready to compile and run all executable demo classes.

With Ant

First make sure you have the build tool Ant installed on your system. Now you can use the demo build script build.xml located in <yFilesDir>/src/demo to launch each demo by specifying its simple class name as a target. Alternatively, launch the interactive demo driver by specifying run as target to conveniently access all demos.