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 [email protected] https://lists.neo4j.org/mailman/listinfo/user
- [Neo4j] Multiple-source lowest-cost path search Giacomo Bernardi
- Re: [Neo4j] Multiple-source lowest-cost path search Akhil
- Re: [Neo4j] Multiple-source lowest-cost path sea... Giacomo Bernardi
- Re: [Neo4j] Multiple-source lowest-cost path... Jim Webber
- Re: [Neo4j] Multiple-source lowest-cost path... Mattias Persson
