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

Posted to dev@hugegraph.apache.org by "gaeduf (via GitHub)" <gi...@apache.org> on 2023/02/08 07:36:16 UTC

[GitHub] [incubator-hugegraph] gaeduf opened a new issue, #2105: 在hugegraph中，如何实现三个及以上顶点之间的最短路径查询？

gaeduf opened a new issue, #2105:
URL: https://github.com/apache/incubator-hugegraph/issues/2105

   ### Problem Type (问题类型)
   
   None
   
   ### Before submit
   
   - [X] 我已经确认现有的 [Issues](https://github.com/hugegraph/hugegraph/issues) 与 [FAQ](https://hugegraph.github.io/hugegraph-doc/guides/faq.html) 中没有相同 / 重复问题
   
   ### Environment (环境信息)
   
   无
   
   ### Your Question (问题描述)
   
   在hugegraph中，如何实现三个及以上顶点之间的最短路径查询？
   
   ### Vertex/Edge example (问题点 / 边数据举例)
   
   _No response_
   
   ### Schema [VertexLabel, EdgeLabel, IndexLabel] (元数据结构)
   
   _No response_


-- 
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: dev-unsubscribe@hugegraph.apache.org.apache.org

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

[GitHub] [incubator-hugegraph] gaeduf closed issue #2105: 在hugegraph中，如何实现三个及以上顶点之间的最短路径查询？

Posted by "gaeduf (via GitHub)" <gi...@apache.org>.

gaeduf closed issue #2105: 在hugegraph中，如何实现三个及以上顶点之间的最短路径查询？
URL: https://github.com/apache/incubator-hugegraph/issues/2105


-- 
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: dev-unsubscribe@hugegraph.apache.org

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

[GitHub] [incubator-hugegraph] javeme commented on issue #2105: 在hugegraph中，如何实现三个及以上顶点之间的最短路径查询？

Posted by "javeme (via GitHub)" <gi...@apache.org>.

javeme commented on issue #2105:
URL: https://github.com/apache/incubator-hugegraph/issues/2105#issuecomment-1426933975

   可以尝试使用All Shortest Paths：https://hugegraph.apache.org/docs/clients/restful-api/traverser/#329-all-shortest-paths ，将3个顶点ID分别放入到两个集合作为参数。


-- 
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: dev-unsubscribe@hugegraph.apache.org

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