Graphlab Shortest Path Algorithm

User 84 | 4/8/2015, 7:29:50 PM

Which specific shortest path algorithm is in the Graphlab sssp implementation? Dijkstra? Thanks.

Comments

User 1592 | 4/9/2015, 6:20:11 AM

Hi, Dijkstra is a centralized algorithm, while <a href="http://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm">Bellman Ford</a> is the equivalent distributed algorithm. We implement Bellman Ford.