Avery Ching commented on GIRAPH-28:

boolean hasEdge(I targetVertexId) is fine as an alternative.  For the iterators 
though, we are returning an iterator of type Edge<I, E>, so we will have to 
create those Edge<I, E> objects on the fly for some implementations.  I suppose 
that hasEdge() adds a bit of work though to check before adding or removing as 
opposed to returning the full edge.  I think I'd lean a slight bit in the 
Edge<I, E> methods for consistency and reduced code.  But I can be out-voted. =)

> Introduce new primitive-specific MutableVertex subclasses
> ---------------------------------------------------------
>                 Key: GIRAPH-28
>                 URL: https://issues.apache.org/jira/browse/GIRAPH-28
>             Project: Giraph
>          Issue Type: New Feature
>          Components: graph
>    Affects Versions: 0.70.0
>            Reporter: Jake Mannix
>            Assignee: Jake Mannix
>         Attachments: GIRAPH-28.diff, GIRAPH-28.diff
> As discussed on the list, 
> MutableVertex<LongWritable,DoubleWritable,FloatWritable,DoubleWritable> (for 
> example) could be highly optimized in its memory footprint if the vertex and 
> edge data were held in a form which minimized Java object usage.

This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira


Reply via email to