mahout-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Saikat Kanjilal <sxk1...@hotmail.com>
Subject Re: shortest-path maintenance
Date Fri, 20 Apr 2012 15:37:43 GMT
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 <mspreitz@us.ibm.com> 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

Mime
View raw message