[
https://issues.apache.org/jira/browse/HAMA-359?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13009279#comment-13009279
]
Thomas Jungblut commented on HAMA-359:
--------------------------------------
I think it should at least be scalable, no matter if sparse or dense.
Weight or unweight is just a matter of what's defined by the user, the
algorithm should IMO deal with negative weights, zero weights (or unweighted)
and of course positive weights.
So I've implemented a few graph algorithms using MapReduce and can't wait for
this task here using BSP. I'm gonna apply to it.
1+ overall :)
> 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
> 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
