TarjanOfflineLeastCommonAncestorAlgorithm<'TVertex, 'TEdge>
Namespace: QuickGraph.Algorithms
Offline least common ancestor in a rooted tre
Constructors
| Constructor | Description |
new(visitedGraph)
Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> unit
|
|
new(host, visitedGraph)
Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge>) -> unit
|
Instance members
| Instance member | Description |
Ancestors
Signature: IDictionary<SEquatableEdge<'TVertex>,'TVertex>
|
|
Compute(root, pairs)
Signature: (root:'TVertex * pairs:IEnumerable<SEquatableEdge<'TVertex>>) -> unit
|
|
SetVertexPairs(pairs)
Signature: pairs:IEnumerable<SEquatableEdge<'TVertex>> -> unit
|
|
TryGetVertexPairs(pairs)
Signature: pairs:byref<IEnumerable<SEquatableEdge<'TVertex>>> -> bool
|
