incubator-hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Thomas Jungblut (JIRA)" <>
Subject [jira] [Commented] (HAMA-359) Development of Shortest Path Finding Algorithm
Date Fri, 08 Apr 2011 06:08:05 GMT


Thomas Jungblut commented on HAMA-359:

So I found that that bsp dijkstra won't deal with not connected graphs properly, I fixed that
with the good old mapreduce vertex update counter :D
So the mainloop is now:
// do stuff
and not
while(we not visited all vertices)
// do stuff

If I would be evil, we could provide a real simple version of dijkstra in the next hama version
with the wikipedia example I used.
So you would have a scalable and a teaching example.

> Development of Shortest Path Finding Algorithm
> ----------------------------------------------
>                 Key: HAMA-359
>                 URL:
>             Project: Hama
>          Issue Type: New Feature
>          Components: examples
>    Affects Versions: 0.2.0
>            Reporter: Edward J. Yoon
>            Assignee: Edward J. Yoon
>              Labels: gsoc, gsoc2011, mentor
>             Fix For: 0.3.0
>   Original Estimate: 2016h
>  Remaining Estimate: 2016h
> The goal of this project is development of parallel algorithm for finding a Shortest
Path using Hama BSP.

This message is automatically generated by JIRA.
For more information on JIRA, see:

View raw message