AcyclicShortestPaths

About AcyclicShortestPaths Android App

This application demonstrates a method for finding the shortest path in a directed weighted acyclic graph using topological sorting as described in the book "Algorithms" by Robert Sedgewick and Kevin Wayne. To add a vertex to the graph, tap on the screen. To add an edge to the graph, tap on the start vertex, then tap on the end vertex, then enter a value for the weight. To find the shortest weighted distance between two vertices, long press on the start vertex, then long press on the end vertex. To clear the screen, tap on the "Clear" button.