Not sure about Mahout, but you can find these functionalities in neo4j.
On 20-04-2012 20:58, Mike Spreitzer 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? Thanks, Mike
