rewangz commented on issue #2359: URL: https://github.com/apache/incubator-hugegraph/issues/2359#issuecomment-1825150387
> Thank you for your willingness to use and contribute. The community welcomes everyone to join and provides relevant contextual references > > Some refer: > > * [[Doc] Contribution Guidelines & Quick Start for HugeGraph #2212 (comment)](https://github.com/apache/incubator-hugegraph/issues/2212#issuecomment-1567148169) > * current algo struct: (TP & AP) > > 1. https://github.com/apache/incubator-hugegraph/tree/master/hugegraph-server/hugegraph-api/src/main/java/org/apache/hugegraph/api/traversers > 2. https://github.com/apache/incubator-hugegraph/tree/master/hugegraph-server/hugegraph-core/src/main/java/org/apache/hugegraph/job/algorithm 似乎computer是基于分布式实现的（这会使更新每个被扩展的节点），而**s-t最短路径一般情况下并不会实际上扩展如此多的节点**。而分布式对于实现全部节点的单源最短路径更加适合（**neo4j的gds中s-t也只有单线程实现，并且有非常好的效果**）。我的方法是优化数据结构来扩展速度而并非分布式计算来加速，而computer是基于分布式框架的，因此我想知道我应该如何选择： 1. 我应该在computer中实现单机算法 2. 将我到代码提交到server 3. 利用数据结构优化computer已经提交的分布式算法（https://github.com/apache/incubator-hugegraph-computer/issues/283） 这也是我这几天一直在纠结的问题。 -- 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: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
