I'm not sure I understand your answer. What I'd like to build is a graph where every node that is not a source has a shortest path to any one of the sources.
Any idea? I see that neo4j's Dijkstra implementation requires to specify a start AND and end node. Isn't there at least a version that calculates the path for a start node and every other end node? Thanks! On 20 June 2011 03:53, Akhil <azk...@cse.psu.edu> wrote: > On 6/19/2011 7:11 PM, Giacomo Bernardi wrote: >> I'd like to build a second graph in which each e in (S-E) is connected > From what i understood, connecting S-E to an arbitary node A1 and S > with another arbitary node A2 and finding the lowest cost shortest path > between A1 and A2 should give you the solution > _______________________________________________ > Neo4j mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user > -- Giacomo "mino" Bernardi _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
