英文:
Can I use Yen's k-shortest path algorithm in Memgraph?
问题
我正在尝试查找Memgraph中Yen的k最短路径算法的实现，但在文档中找不到。我有所遗漏吗？
我正在使用Memgraph 2.7，并通过Docker运行了它。
英文:
I am trying to find if there is an implementation of Yen's k-shortest path algorithm in Memgraph and I can't find it in the documentation. Am I missing something or?
I am using Memgraph 2.7 and I ran it with Docker.
答案1
得分: 0
Currently (Memgraph 2.7), there is no implementation of Yen's k-shortest path algorithm, but there is All shortest paths algorithm in Memgraph that is basically an expansion of a classic Dijkstra's algorithm. If I got it right, for k=1, you need Dijkstra and that's Weighted shortest in Memgraph. With All shortest paths you get k=(all paths). There is a missing part of having k=n, for any number of paths.
Here is the documentation for Weighted shortest path built-in algorithm in Memgraph (Dijkstra) (k=1 in your case). Here is documentation for All shortest paths (k = all paths in your case).
英文:
Currently (Memgraph 2.7), there is no implementation of Yen's k-shortest path algorithm, but there is All shortest paths algorithm in Memgraph that is basically an expansion of a classic Dijkstra's algorithm. If I got it right, for k=1, you need Dijkstra and that's Weighted shortest in Memgraph. With All shortest paths you get k=(all paths). There is a missing part of having k=n, for any number of paths.
Here is the documentation for Weighted shortest path built-in algorithm in Memgraph (Dijkstra) (k=1 in your case). Here is documentation for All shortest paths (k = all paths in your case).
通过集体智慧和协作来改善编程学习和解决问题的方式。致力于成为全球开发者共同参与的知识库，让每个人都能够通过互相帮助和分享经验来进步。
评论