Any advise on this issue? Do you need more information?

Thanks & Regards

From: rui_sarme...@hotmail.com
To: user@giraph.apache.org
Subject: RE: Input formats
Date: Fri, 22 Mar 2013 20:46:57 +0000




Thanks for the info. It seems I'm unable to run 
...examples.SimpleShortestPathsVertex with these input formats, is there a 
converter available to convert from these formats to VertexInputFormat.
I mean I tried with the converted undirected edge list to the [3,0,[[843,0]]] 
format but I'm getting the following error:

"Exception in thread "main" java.lang.NullPointerException"

Thanks in advance for your advise.

Regards


From: alessan...@fb.com
To: user@giraph.apache.org
Subject: Re: Input formats
Date: Fri, 22 Mar 2013 18:36:02 +0000






The first one looks like IntNullTextEdgeInputFormat. For the second one you can 
do something similar to AdjacencyListTextVertexInputFormat, except that you 
don't have edge values.
It's not a requirement to have the input split across several files. It's 
desired if you have a big dataset, but HDFS should handle that.





From: Rui Sarmento <rui_sarme...@hotmail.com>

Reply-To: "user@giraph.apache.org" <user@giraph.apache.org>

Date: Friday, March 22, 2013 11:29 AM

To: Giraph Support <user@giraph.apache.org>

Subject: Input formats








Hi all,



What are the input formats to use for edge lists and adjacency lists in the 
following layout:



For Edge List (undirected):



1  3

3  2

4  8

5  3

.   .

.   .

.   .



and for adjacency lists like:



1   2

2   3

3   1   2   5   

4   8

5   3

.    .

.    .

.    .



and other question, is it requirement to have the network divided in several 
part files in hdfs?



Thanks very much for your help.



Regards





                                                                                
  

Reply via email to