4 ms·
It is certainly an achetypical graph problem, shortest path, of which there are many ways to solve. Some algorithms are very highly efficient. I've tried some g
by darksaints 3y ago
It is certainly an achetypical graph problem, shortest path, of which there are many ways to solve. Some algorithms are very highly efficient. I've tried some graph databases and was quite surprised at how hard they were to express using their query languages and how hard it was to solve them efficiently. I've had better luck with library based solutions.
- esafak 3y agoBeing an archetypical query, the shortest path is usually explicitly covered in the documentation: https://neo4j.com/docs/cypher-manual/current/appendix/tutorials/shortestpath-planning/ https://neo4j.com/docs/cypher-manual/current/appendix/tutori...