giraph-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Eli Reisman (JIRA)" <>
Subject [jira] [Commented] (GIRAPH-221) Make iteration over edges more explicit
Date Fri, 29 Jun 2012 05:25:44 GMT


Eli Reisman commented on GIRAPH-221:

Doesn't the I in Edge<I,E> represent the id of the vertex the out-edge leads to, and
the E is the edge value if there is one. so i think just returning I would not be enough information
for all algorithms someone might implement. Also, with the inclusion of sendMsgToAllEdges()
in GIRAPH-220 today, it does seem like this one is kind of resolved for now.

> Make iteration over edges more explicit
> ---------------------------------------
>                 Key: GIRAPH-221
>                 URL:
>             Project: Giraph
>          Issue Type: Improvement
>          Components: graph
>            Reporter: Alessandro Presta
>            Assignee: Alessandro Presta
>            Priority: Minor
> Is there any particular reason why BasicVertex implements Iterable?
> It seems to me that doing
> {code:java}
> for (I neighbor : vertex)
> {code}
> is not that explicit, and
> {code:java}
> for (I neighbor : this)
> {code}
> gets even obscure (which may be why all examples in the codebase explicitly instantiate
an iterator and call next()).
> What I propose is a more explicit
> {code:java}
> Iterator<I> outEdgesIterator()
> {code}
> and also a convenient
> {code:java}
> Iterable<I> outEdges()
> {code}
> so, for example, an algorithm can use
> {code:java}
> for (IntWritable neighbor : outEdges())
> {code}

This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:!default.jspa
For more information on JIRA, see:


View raw message