BellmanFordShortestPaths

About BellmanFordShortestPaths Android App

This application demonstrates the Bellman Ford method for finding the shortest path in a directed weighted graph which allows negative weights 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. Weights can be positive or negative. To find the shortest path 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.