Uses of Interface
com.jgalgo.alg.tree.LowestCommonAncestorDynamic.Vertex
Packages that use LowestCommonAncestorDynamic.Vertex
Package
Description
Algorithms specifically for tree graphs, such as LCA or TPM.
-
Uses of LowestCommonAncestorDynamic.Vertex in com.jgalgo.alg.tree
Methods in com.jgalgo.alg.tree that return LowestCommonAncestorDynamic.VertexModifier and TypeMethodDescriptionLowestCommonAncestorDynamic.addLeaf(LowestCommonAncestorDynamic.Vertex parent) Add a new leaf vertex to the tree.LowestCommonAncestorDynamicGabowInts.addLeaf(LowestCommonAncestorDynamic.Vertex parent) LowestCommonAncestorDynamicGabowLongs.addLeaf(LowestCommonAncestorDynamic.Vertex parent) LowestCommonAncestorDynamicGabowSimple.addLeaf(LowestCommonAncestorDynamic.Vertex parent) LowestCommonAncestorDynamic.findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex u, LowestCommonAncestorDynamic.Vertex v) Find the lowest common ancestor of two vertices in the tree.LowestCommonAncestorDynamicGabowInts.findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex x, LowestCommonAncestorDynamic.Vertex y) LowestCommonAncestorDynamicGabowLongs.findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex x, LowestCommonAncestorDynamic.Vertex y) LowestCommonAncestorDynamicGabowSimple.findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex x, LowestCommonAncestorDynamic.Vertex y) LowestCommonAncestorDynamic.Vertex.getParent()Get the parent vertex of this vertex.LowestCommonAncestorDynamic.initTree()Initialize the tree the LCA will operate on and create a root vertex.LowestCommonAncestorDynamicGabowInts.initTree()LowestCommonAncestorDynamicGabowLongs.initTree()LowestCommonAncestorDynamicGabowSimple.initTree()Methods in com.jgalgo.alg.tree with parameters of type LowestCommonAncestorDynamic.VertexModifier and TypeMethodDescriptionLowestCommonAncestorDynamic.addLeaf(LowestCommonAncestorDynamic.Vertex parent) Add a new leaf vertex to the tree.LowestCommonAncestorDynamicGabowInts.addLeaf(LowestCommonAncestorDynamic.Vertex parent) LowestCommonAncestorDynamicGabowLongs.addLeaf(LowestCommonAncestorDynamic.Vertex parent) LowestCommonAncestorDynamicGabowSimple.addLeaf(LowestCommonAncestorDynamic.Vertex parent) LowestCommonAncestorDynamic.findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex u, LowestCommonAncestorDynamic.Vertex v) Find the lowest common ancestor of two vertices in the tree.LowestCommonAncestorDynamicGabowInts.findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex x, LowestCommonAncestorDynamic.Vertex y) LowestCommonAncestorDynamicGabowLongs.findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex x, LowestCommonAncestorDynamic.Vertex y) LowestCommonAncestorDynamicGabowSimple.findLowestCommonAncestor(LowestCommonAncestorDynamic.Vertex x, LowestCommonAncestorDynamic.Vertex y)