Jakob Homan updated GIRAPH-62:

    Attachment: GIRAPH-62.patch

Patch to create a new vertex reader, which is parameterized on the type of the 
id, its edge and edge values.  Implementers just have to fill in these methods 
to ready a new adjacency list encoded as above.  One is provided for lists 
where the id is a long and the edges and values are doubles, a common format.  
I've tested this against a modified pagerankbenchmark (patch coming) and every 
works as expected.  Introduces mockito for unit testing.
> Provide input format for reading graphs stored as adjacency lists
> -----------------------------------------------------------------
>                 Key: GIRAPH-62
>                 URL: https://issues.apache.org/jira/browse/GIRAPH-62
>             Project: Giraph
>          Issue Type: New Feature
>          Components: lib
>            Reporter: Jakob Homan
>            Assignee: Jakob Homan
>         Attachments: GIRAPH-62.patch
> We should provide as many options for getting data in/out of Giraph as 
> possible.  One common format is adjacency lists, with each edge id, its 
> value, and its edges and their values per line.  It would be good to provide 
> inputformats to handle this type of data with minimal effort from the user.

This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators: 
For more information on JIRA, see: http://www.atlassian.com/software/jira


Reply via email to