Anyone want to work on https://issues.apache.org/jira/browse/GIRAPH-155? =)
On 4/19/12 9:22 AM, Claudio Martella wrote:
The problem with this approach is that Giraph doesn't support
multi-graphs. Following RDF, you can have multiple edges connecting
the same pair of vertices.
So for methods such
The problem with this approach is that Giraph doesn't support
multi-graphs. Following RDF, you can have multiple edges connecting
the same pair of vertices.
So for methods such as getEdgeValue(I) you'd have to return something
like List. For this, I'd suggest to forget the Giraph specific
methods a
Hi Avery and Paolo,
On 11 Apr 2012, at 18:37, Avery Ching wrote:
> There is no "preferred way" to represent labeled graphs. A close example to
> your adjacency list idea is LongDoubleDoubleAdjacencyListVertexInputFormat.
Exactly. Giraph supports labeled Graphs very easily.
My reply is a li
There is no "preferred way" to represent labeled graphs. A close
example to your adjacency list idea is
LongDoubleDoubleAdjacencyListVertexInputFormat.
Hope that helps,
Avery
On 4/11/12 10:00 AM, Paolo Castagna wrote:
Hi,
I am not sure what's the best way to represent labeled graphs in Gira
Hi,
I am not sure what's the best way to represent labeled graphs in Giraph.
Here is my graph (i.e. vertex_id --edge_label_id--> vertex_id ):
32 --62--> 115
32 --153--> 189
32 --200--> 236
32 --266--> 303
32 --266--> 331
32 --266--> 363
303 --153--> 407
303 --266--> 331
331 --153--> 394
331 --266
