# OpenGraph DrawingFramework

v. 2022.02 (Dogwood)

LCA.h File Reference

The Sparse Table Algorithm for the Least Common Ancestor problem as proposed by Bender and Farach-Colton. More...

#include <ogdf/basic/Graph.h>

Go to the source code of this file.

## Classes

class  ogdf::LCA
Implements the <O(n log n), O(1)>-time "sparse table" algorithm by Bender and Farach-Colton to compute lowest common ancestors (LCAs) in arborescences (not arbitrary directed acyclic graphs). More...

## Namespaces

ogdf
The namespace for all OGDF objects.

## Detailed Description

The Sparse Table Algorithm for the Least Common Ancestor problem as proposed by Bender and Farach-Colton.

License:
This file is part of the Open Graph Drawing Framework (OGDF).
Copyright (C)
See README.md in the OGDF root directory for details.
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License Version 2 or 3 as published by the Free Software Foundation; see the file LICENSE.txt included in the packaging of this file for details.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program; if not, see http://www.gnu.org/copyleft/gpl.html

Definition in file LCA.h.