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?
Thanks, Mike
