On 20 April 2012 17:28, Mike Spreitzer <[email protected]> wrote: > Is there something in Mahout that maintains shortest paths (or simply > distance) from a distinguished vertex in a graph? That is, given a graph > in which this problem has been solved, and a small change in that graph, > something that will efficiently find the answers for the graph after the > small change?
Have a look at Apache Giraph, e.g. https://github.com/aching/Giraph/wiki/Shortest-Paths-Example Dan
