This demonstrates the shortest path algorithms in JUNG. When a user selects two vertices, the system chooses one shortest path between those two vertices and colors it. The graph is randomly generated by the EppsteinPowerLawGenerator.