I am interested in calculating the lowest common ancestors of several nodes in a directed graph. I tested the findlcas method proposed by the NaiveLcaFinder class of the jGrapht project (https://github.com/jgrapht/jgrapht/blob/master/jgrapht-core/src/main/java/org/jgrapht/alg/NaiveLcaFinder.java) but I found it very difficult to apply it for several nodes. Could you please help me on this point? or give me some suggestions

More Hajar Elmaghraoui's questions See All
Similar questions and discussions