[
https://issues.apache.org/jira/browse/HAMA-550?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13293911#comment-13293911
]
Apurv Verma commented on HAMA-550:
----------------------------------
There's a problem I am stuck at, the current graph implementation is such that
when a node receives no messages, compute() is not called upon it in that
superstep.
But sometimes in some algorithms (like in bipartite matching), a vertex not
receiving any messages is just the trigger for it to send messages in the
current superstep. Instead of not calling compute() at all, can we call it with
an empty iterator.
@thomas, can it be changed quickly without affecting the other algorithms? If
yes, please do it.
> Implementation of Bipartite Matching
> ------------------------------------
>
> Key: HAMA-550
> URL: https://issues.apache.org/jira/browse/HAMA-550
> Project: Hama
> Issue Type: New Feature
> Components: examples, graph
> Reporter: Edward J. Yoon
> Assignee: Apurv Verma
> Labels: examples
> Fix For: 0.5.0
>
> Attachments: HAMA-550.patch, tgraph.txt
>
>
> See http://markmail.org/thread/eaq7p5r2bbjoyfsa
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:
https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
