Hi,
I believe the answer to your question is yes, though I've never done it. If
you use only the edge reader, only the vertices in your graph that have at
least one edge attached to them will be present in your graph. So, if you
have vertices that are entirely disconnected that you want included,
Thanks for that!
This is the right idea, however I was only using a VertexReader until now
– IntNullReverseTextEdgeInputFormat calls for an EdgeReader.
I am not sure this is the way it works but I like the idea of segregating
edge and vertex definitions.
*That leads to the following questions:
Have a look at IntNullReverseTextEdgeInputFormat
https://giraph.apache.org/apidocs/org/apache/giraph/io/formats/IntNullReverseTextEdgeInputFormat.html.
It automatically creates reverse edges, but it expects the file format
source_id, target_id
on each line. If you need to convert it to use longs
Hi Giraph Mailing List,
I am writing about an undirected graph I am trying to move to Giraph. I
have a question about the assumption Giraph makes when processing an input.
Let V1 and V2, two vertices connected with a common edge. E1 defines an
edge from V1 to V2. E2 defines an edge from V2 to
