FourBlockTree.h File Reference

Declaration of FourBlockTree. More...

#include <ogdf/basic/Graph_d.h>
#include <ogdf/basic/NodeArray.h>
#include <memory>
#include <vector>

Go to the source code of this file.

Classes
struct	ogdf::FourBlockTree
	A node in a 4-block tree. More...

Namespaces
	ogdf
	The namespace for all OGDF objects.

Detailed Description

Declaration of FourBlockTree.

Based on the implementation and techiques of the following papers:

Norishige Chiba, and Takao Nishizeki. Arboricity and subgraph listing algorithms. SIAM Journal on computing 14.1 (1985): 210-223. doi:10.1137/0214017.

Sabine Cornelsen, and Gregor Diatzko. Decomposing Triangulations into 4-Connected Components. arXiv [cs.DS], 2023. doi:10.48550/arXiv.2308.16020.

Author

Gregor Diatzko

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 FourBlockTree.h.