rewangz commented on issue #283: URL: https://github.com/apache/incubator-hugegraph-computer/issues/283#issuecomment-1825056112
Due to the relatively small traversals of the graph in most cases with the S-T Dijkstra algorithm, I have completed a single-machine version of Dijkstra's algorithm. As my practical work scenario does not require real-time modifications to the graph, I have completed an in-memory projection method. This involves fixing all the necessary edges in memory based on their (s,t,w) and updating them in a manner determined by the graph user. I would like to know how much my implementation differs from the requirements of HugeGraph so that I can make adjustments to my code accordingly. -- 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]
