Using Jung Algorithms with Faunus

[Harsh Kumar]

Hi,

Is there a way to use Jung Algorithms (Dijkstras, PageRank...etc) with Faunus.

I know that it is possible to use Jung in gremlin with blueprints.

Something along these lines: https://github.com/tinkerpop/gremlin/wiki/Using-JUNG

[Marko Rodriguez]

Hello,

No, there is no way to do this. The API for Faunus is batch oriented with vertex-by-vertex processing (and then message passing -- breadth first). The JUNG API assumes all the data in-memory and vertices can be traversed depth-first.

Marko.

http://markorodriguez.com

--
You received this message because you are subscribed to the Google Groups "Aurelius" group.
To unsubscribe from this group and stop receiving emails from it, send an email to aureliusgraph...@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.

[Harsh Kumar]

Hi, 

Just a quick clarification. TitanGraph can be converted to GraphJung. Does that mean that the entire TitanGraph is loaded in memory? 

Thanks

Harsh Kumar

--

Stay Great

Harsh Kumar

[Marko Rodriguez]

Hi,

Just a quick clarification. TitanGraph can be converted to GraphJung. Does that mean that the entire TitanGraph is loaded in memory? 

Sorta ---- realize that if you are doing a PageRank, you are pulling that entire graph into memory (in a transaction) as each edge is traversed. Thus, by the end of the PageRank calculation (via Jung), the entire graph is in the transaction.

HTH,

Marko.

http://thinkaurelius.com

[Harsh Kumar]

Hi, 

Ok, that does answer my question but leads me to another one. 

While calculating shortest path (Dijkstras) the answer would basically be a sub-graph of the main graph. 

So does it make sense for me to use Faunus, some kind of graph derivation, to try out Dijkstras?

Your help is highly appreciated :)

[Harsh Kumar]

Hi,

Let me be a little more clear about what I want to achieve.

I am looking for some BSP examples in Faunus so that I can run a Single Source Shortest Path (Dijkstras) algorithm. Something very similar to this for Hama.

It appears that it should be possible to do this with Faunus. Can you please guide me through how to go forward with this?

Thanks
Harsh Kumar

[Marko Rodriguez]

Hi,

As it currently stands (until Faunus implements Furnace's vertex computing model), I would say that your best bet for this is to use JUNG over Titan, not Faunus.

Good luck,

Marko.

http://markorodriguez.com