If you're willing to use a pre-production-ready piece of software, I suggest you use Apache Giraph for this kind of problem.
It uses a graph-based programming model where parts of the graph can be "deactivated" which could prove to be very handy in the case of only small changes. Best, Sebastian On 20.04.2012 17:56, Mike Spreitzer wrote: > I am wondering what is the best way to do this using map-reduce. Both for > the special case of only adding edges, and the general case where edges > may be removed. > > Thanks, > Mike > > > > From: Saikat Kanjilal <[email protected]> > To: "[email protected]" <[email protected]> > Date: 04/20/2012 11:46 AM > Subject: Re: shortest-path maintenance > > > > Hi Mike, > Neo4j does this and is meant for this (www.neo4j.org) type of calculation. > Are you looking to solve this within a particular algorithm in mahout? > > Regards > > Sent from my iPhone > > On Apr 20, 2012, at 8:28 AM, 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? >> >> Thanks, >> Mike > > >
