Hello everyone, could you advice on the best way to do the following in neo4j?
Given: - a graph G=<V, E> on which each node has an associated positive cost - a subset of "source" nodes S in E. I'd like to build a second graph in which each e in (S-E) is connected to any one of the source nodes S via the lowest-cost path. I don't seem to find anything ready to use for this purpose in neo4j, am I right? Thanks! mino _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
