You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@hugegraph.apache.org by "Henryzhao-666 (via GitHub)" <gi...@apache.org> on 2024/09/03 07:20:41 UTC

Re: [I] 在hugegraph中，如何实现三个及以上顶点之间的最短路径查询？ [incubator-hugegraph]

Henryzhao-666 commented on issue #2105:
URL: https://github.com/apache/incubator-hugegraph/issues/2105#issuecomment-2325779680

   > 可以尝试使用All Shortest Paths：https://hugegraph.apache.org/docs/clients/restful-api/traverser/#329-all-shortest-paths ，将3个顶点ID分别放入到两个集合作为参数。
   这个接口的效率好低，10次有9次失败的，并且只支持最大10个顶点的分析。经常失败大概什么原因吗
   


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: issues-unsubscribe@hugegraph.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org


---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@hugegraph.apache.org
For additional commands, e-mail: issues-help@hugegraph.apache.org