You are viewing a plain text version of this content. The canonical link for it is here.
Posted to user@giraph.apache.org by 尹红军 <hj...@gmail.com> on 2013/07/02 08:14:29 UTC
[about giraph]
I wonder if giraph can do analysis reachability of large scale graph?
Have anyone tried to do that?
--
Best regards,
Your sincerely Hongjun Yin(尹红军)
School of Computer Science and Technology, University of Science and
Technology of China.
Re: Bi-directional and multigraphs
Posted by Avery Ching <ac...@apache.org>.
You can easily add bi-directional edges. When you load the edge, simply
also load the reciprocal edge. I.e. if you add a->b, also add b->a.
On 7/2/13 1:11 AM, Pascal Jäger wrote:
> Hi everyone,
>
> I am currently getting my hands on giraph which is why I am trying to
> implement a maximum flow algorithm originally designed for MapReduce.
> The algorithm requires bi-directional edges.
>
> * Are bi-directional edges supported in giraph?
> * Where would I find them?
>
> Thanks
>
> Pascal
>
Bi-directional and multigraphs
Posted by Pascal Jäger <pa...@pascaljaeger.de>.
Hi everyone,
I am currently getting my hands on giraph which is why I am trying to implement a maximum flow algorithm originally designed for MapReduce.
The algorithm requires bi-directional edges.
* Are bi-directional edges supported in giraph?
* Where would I find them?
Thanks
Pascal