[
https://issues.apache.org/jira/browse/HAMA-359?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13030291#comment-13030291
]
Thomas Jungblut commented on HAMA-359:
--------------------------------------
Thx.
I've added:
- a opportunity that the user can submit their own adjacency list as
sequencefile
- the user can now choose from which vertex he want to start
- manipulate the output path
And I've added this to the example driver.
So this should be rdy, I'm submitting this to Hudson.
> 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: Thomas Jungblut
> Labels: gsoc, gsoc2011, mentor
> Fix For: 0.3.0
>
> Attachments: HAMA-359.patch, HAMA-359_v2.patch
>
> 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
