Least Common Ancestor in a Graph.

[sudhir...@gmail.com]

Hi,

I am trying to compute Least Common Ancestor for a set of nodes in a graph. Is this operation supported in the Grph Library.

Basically what I need as follows: Given a subset of nodes in a graph, I need to find a common Ancestor to all of them. Meaning, If we perform breadth first search from each of these nodes, the common Ancestor will be the first node where the BFS converges.

Can you please tell me how can I do this in Grph Library.

Thanks
Sudhir Kylasa

[Luc Hogie]

Hi Sudhir,

Sorry this algorithm is not provided but it would indeed be a great addition to the library. I ever you plan to implement it, we'd be happy to integrate it into the code.

Cheers,

Luc.

--
You received this message because you are subscribed to the Google Groups "Grph: High Performance Graph Library for Java" group.
To unsubscribe from this group and stop receiving emails from it, send an email to grph-high-performance-gr...@googlegroups.com.
To post to this group, send an email to grph-high-performa...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

--

Luc Hogie 

Phone: 06 80 91 40 71

Skype: luchogie

"Je suis heureux parce que c'est bon pour la santé" Voltaire

[Sudhir Kylasa]

Dear Luc Hogie : 

Thanks for your prompt response. 

I will send my implementation over to you in a couple of days. I need this algorithm for my research paper, which is underway. 

We can work on integrating it into the library if you guys are OK with it. 

I will keep you guys posted on this one.

Thanks

Sudhir Kylasa

[Luc Hogie]

For sure we are! Any fruitful collaboration is highly welcome :)

By the way, what is your research topic about?