Jake Mannix commented on GIRAPH-28:

So Avery, the question I have for you is regarding the getOutEdgeMap() method - 
if we get rid of that, and instead maybe offer something like the other methods 
discussed on the list thread:  

  E getEdge(I targetVertexId); 
  ImmutableList<I> getSortedOutVertices();
  boolean removeEdge(I targetVertexId);

we could do away with being tied to this TreeMap (although for now, keep it 
around in Vertex.java, as there's not much else possible in the generic object 
case, most likely), in addition to allowing me to remove my insane "pretend" 
SortedMap wrapper class.

> 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
> 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