Hi,
I am planning to use giraph for network analysis. First I am trying to
fully understand SimplePageRankVertex implementation and modify in order to
serve my needs.
I have a question about example,
What is the expected input format for SimplePageRankVertex, I couldn't
understand the input forma
The easiest thing to do is to extend text vertex or/and textvertext input
> format and/or the record reader. The record reader will give you the
> vertices you want. Look at the record reader for textvertexinputformat.
> It's an innerclass on this format class.
>
> Sent from my H
I am using pseudo distribudet cluster
On 19 February 2012 02:00, David Garcia wrote:
> Are you submitting this job to a pseudo distributed cluster or a fully
> distributed cluster?
>
>
> Sent from my HTC Inspire™ 4G on AT&T
>
> - Reply message -
> From: &qu
Hello,
I am writing my own giraph algorithms to understand the system,
I have again a question about IntIntNullIntVertex
I think IntIntNullIntVertex.initialize method should handle "null" edges
argument
because in VertexResolver.resolve method (line:91) vertex.initialize is
called with edge argum
gt; to make it easier to avoid forgetting checks in the implementing code.
>
> --sebastian
>
>
>
> On 19.02.2012 19:47, yavuz gokirmak wrote:
> > Hello,
> >
> > I am writing my own giraph algorithms to understand the system,
> > I have ag
g/common/docs/r0.18.3/mapred_tutorial.html#DistributedCache
>
> hope this helps.
>
> From: yavuz gokirmak [ygokir...@gmail.com]
> Sent: Sunday, February 19, 2012 2:19 AM
> To: giraph-user@incubator.apache.org
> Subject: Re: how to use SimplePageRankVertex
>
> I am using
Hi again,
I am trying to estimate minimum requirements to process graph analysis over
my input data,
In shortest path example it is said that
"The first thing that happens is that getSplits() is called by the master
and then the workers will process the InputSplit objects with the
VertexReader to
store them (hence your
> estimates are definitely too low). How big is the actual graph that you
> are trying to analyze in terms of vertices and edges?
>
> Avery
>
>
> On 2/19/12 10:45 PM, yavuz gokirmak wrote:
>
>> Hi again,
>>
>> I am trying to estimate mini
Pregel, even when out-of-core graph and messages
> implementations will be ready.
>
> Hope this helps,
>
> On Mon, Feb 20, 2012 at 10:25 AM, yavuz gokirmak
> wrote:
> > Yes, I don't need to load a graph of 4tb size,
> >
> >
> > 4tb is the whole t
