问题
We are using Neo4J 2.0 embedded; we have a Graph with around 1 Million of Nodes, and 50 Million of relationships; we have to find N shortestPath but with a well known cost property We saw that there is no such method in GraphAlgo class of neo4j and we were thinking to use Chyper, but when run this query
START startNode = node(269604), endNode = node(269605)
MATCH path=(startNode)-[:CAR_MAIN_NODES_RELATION*]->(endNode)
RETURN path AS shortestPath, reduce(cost=0, rel in relationships(path) | cost + rel.edgeLength) AS totalCost
ORDER BY totalCost ASC
LIMIT 3
after 10 minutes, we have not had any results yet...
Did anybody find a solution to this problem? How could we implement such functionality?
Any suggestion is really apreciated... Thank you Antonio
来源：https://stackoverflow.com/questions/22637194/neo4j-k-shortest-paths-with-cost-property