You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 20 Next »

Single Source Shortest Paths

  • The SSSP algorithm described in the Google Pregel paper was used.
  • Introduces IO usage, partitioning based on hashing of vertextID, and collective communication.

Implementation

TODO: describe internal algorithm shows how it can be implemented using Hama BSP

Usage

TODO:

Have fun! If you are facing problems, feel free to ask questions on the official mailing list.

  • No labels