Mailing-List: contact user-help@giraph.apache.org; run by ezmlm
Precedence: bulk
Reply-To: user@giraph.apache.org
Received-SPF: pass (nike.apache.org: domain of silvio.digregorio@gmail.com
 designates 209.85.223.173 as permitted sender)
MIME-Version: 1.0
In-Reply-To: 
 <CAFLiirEuHpdmEKA1OmPakpbK95ye2aUW6bU2x9uSXbBkTj_mBQ@mail.gmail.com>
References: 
 <CAFLiirEVno02hZfnTEDCuAevWQpuZbS_0M9Ft2WJwCmaXOPyfw@mail.gmail.com>
	<CACcaEW4NDPKQd+Bxvho=vTAB=Hg+FwVM02t5qaL_JjSQT-xSXw@mail.gmail.com>
	<CAFLiirEuHpdmEKA1OmPakpbK95ye2aUW6bU2x9uSXbBkTj_mBQ@mail.gmail.com>
Date: Wed, 16 Oct 2013 08:44:20 +0200
Message-ID: 
 <CACcaEW47p4bWm83rA6wXL03M6-FMToGKpetoZ6zTqdOvbeTHbA@mail.gmail.com>
Subject: Re: changes in SingleSourceShortestPath example
From: Silvio Di gregorio <silvio.digregorio@gmail.com>
To: user@giraph.apache.org
Content-Type: multipart/alternative; boundary=089e01538358ec1a0604e8d607ce

--089e01538358ec1a0604e8d607ce
Content-Type: text/plain; charset=ISO-8859-1

I'm also trying to implement but with poor results. my target is the
betweenness Centrality.
The only thing that i did is generate giraph code throught Green-Marl, but
this is very far from being a running code.
Update us if there are progress.
But if complexity is quadratic in the of space it's hard to do.


2013/10/16 Jyoti Yadav <rao.jyoti26yadav@gmail.com>

> Hi Silvio..
> Thanks for your reply...
>  Yes,  I want to realize All-source- shortest -path..Would you please help
> me out.?
>
>
>
>
> On Tue, Oct 15, 2013 at 12:45 PM, Silvio Di gregorio <
> silvio.digregorio@gmail.com> wrote:
>
>> Do you want realize all-source-shortest path?
>> Il giorno 15/ott/2013 11:21, "Jyoti Yadav" <rao.jyoti26yadav@gmail.com>
>> ha scritto:
>>
>>  Hi..
>>> If I want to run SingleSourceShortest Path example given in  Giraph for
>>> all the vertices ,then what changes I need to introduce and how ??
>>> How master node will come to know that algorithm has successfully
>>> completed for one vertex and it has to consider other vertex and
>>> reinitialize the vertex values ..
>>>
>>> Any ideas are really appreciated....
>>>
>>> Jyoti Yadav
>>>
>>
>

--089e01538358ec1a0604e8d607ce
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">I&#39;m also trying to implement but with poor results. my=
 target is the betweenness Centrality.<div>The only thing that i did is gen=
erate giraph code throught Green-Marl, but this is very far from being a ru=
nning code.</div>
<div>Update us if there are progress.</div><div>But if complexity is quadra=
tic in the of space it&#39;s hard to do.</div></div><div class=3D"gmail_ext=
ra"><br><br><div class=3D"gmail_quote">2013/10/16 Jyoti Yadav <span dir=3D"=
ltr">&lt;<a href=3D"mailto:rao.jyoti26yadav@gmail.com" target=3D"_blank">ra=
o.jyoti26yadav@gmail.com</a>&gt;</span><br>
<blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-left:1p=
x #ccc solid;padding-left:1ex"><div dir=3D"ltr">Hi Silvio..<div>Thanks for =
your reply...</div><div>=A0Yes, =A0I want to realize All-source- shortest -=
path..Would you please help me out.?</div>
<div><br></div><div>=A0</div></div><div class=3D"HOEnZb"><div class=3D"h5">=
<div class=3D"gmail_extra"><br><br><div class=3D"gmail_quote">
On Tue, Oct 15, 2013 at 12:45 PM, Silvio Di gregorio <span dir=3D"ltr">&lt;=
<a href=3D"mailto:silvio.digregorio@gmail.com" target=3D"_blank">silvio.dig=
regorio@gmail.com</a>&gt;</span> wrote:<br><blockquote class=3D"gmail_quote=
" style=3D"margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">

<p>Do you want realize all-source-shortest path?</p>
<div class=3D"gmail_quote">Il giorno 15/ott/2013 11:21, &quot;Jyoti Yadav&q=
uot; &lt;<a href=3D"mailto:rao.jyoti26yadav@gmail.com" target=3D"_blank">ra=
o.jyoti26yadav@gmail.com</a>&gt; ha scritto:<div><div><br type=3D"attributi=
on">

<blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-left:1p=
x #ccc solid;padding-left:1ex">
<div dir=3D"ltr">Hi..<div>If I want to run SingleSourceShortest Path exampl=
e given in =A0Giraph for all the vertices ,then what changes I need to intr=
oduce and how ??</div><div>How master node will come to know that algorithm=
 has successfully completed for one vertex and it has to consider other ver=
tex and reinitialize the vertex values ..</div>


<div><br></div><div>Any ideas are really appreciated....</div><div><br></di=
v><div>Jyoti Yadav=A0</div></div>
</blockquote></div></div></div>
</blockquote></div><br></div>
</div></div></blockquote></div><br></div>

--089e01538358ec1a0604e8d607ce--