giraph-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Jakob Homan (JIRA)" <>
Subject [jira] [Commented] (GIRAPH-160) Vertex reader that reads adjacency lists with no vertex and edge values associated
Date Wed, 06 Jun 2012 10:04:23 GMT


Jakob Homan commented on GIRAPH-160:

Hey Dionysios- Sorry for the delay in reviewing.  Looks good except we need a unit test or
two.  Also, as a nit, {{public static final String GRAPH_HAS_VALUES = "adj.list.input.hasvalues";}}
should have a period between has and values.  Otherwise, looks great.
> Vertex reader that reads adjacency lists with no vertex and edge values associated
> ----------------------------------------------------------------------------------
>                 Key: GIRAPH-160
>                 URL:
>             Project: Giraph
>          Issue Type: New Feature
>          Components: lib
>    Affects Versions: 0.1.0
>            Reporter: Dionysios Logothetis
>            Assignee: Dionysios Logothetis
>            Priority: Minor
>              Labels: features
>             Fix For: 0.2.0
>         Attachments: GIRAPH-160.patch, GIRAPH-160.patch
> A very common format of graphs is adjacency lists with no values associated to edges
or vertices. For instance a line in the input can be of the type:
> 1 2 3
> which represents a vertex with id 1 that has edges to vertices 2 and 3 with no values
> I've created a vertex reader named AdjacencyListVertexReader which is essentially a copy
of the AdjacencyListVertexReader modified to handle this format. It's an abstract class and
subclasses can override the defaultVertexValue() and defaultEdgeValue() methods to provide
default values for vertices and edges correspondingly (otherwise values are initialized to
> I've also created an example subclass.

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