[
https://issues.apache.org/jira/browse/HAMA-359?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13017302#comment-13017302
]
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:
while(updated)
// 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: https://issues.apache.org/jira/browse/HAMA-359
> 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: http://www.atlassian.com/software/jira
