graph / JBellmanFordShortestPath / 0.1.0
Returns the shortest path from one vertex to another in a graph using Bellman Ford Shortest Path algorithm. 

  • A graph represented as a map from vertices (strings) to a list of neighbors (list of strings) OR the url to the Data API file that holds the graph that you would like to be read (currently supported formats: GML)
  • Start vertex (string)
  • End vertex (string)