Open
Graph Drawing
Framework

  v. 2023.09 (Elderberry)
 
Overview Class Hierarchy Class Index Class List Members Namespaces Source Files

Classes | Namespaces
SpannerBermanDisconnected.h File Reference

Implementation of an k-spanner approximation algorithm from Berman et al. More...

#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphAttributes.h>
#include <ogdf/basic/GraphCopy.h>
#include <ogdf/basic/GraphList.h>
#include <ogdf/basic/simple_graph_alg.h>
#include <ogdf/graphalg/SpannerBerman.h>
#include <ogdf/graphalg/SpannerModule.h>
#include <algorithm>
#include <cstdint>
#include <string>

Go to the source code of this file.

Classes

class  ogdf::SpannerBermanDisconnected< TWeight >
 Wrapper around SpannerBerman: For each component of the graph, the algorithm will be called. More...
 

Namespaces

 ogdf
 The namespace for all OGDF objects.
 

Detailed Description

Implementation of an k-spanner approximation algorithm from Berman et al.

Author
Finn Stutzenstein
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 SpannerBermanDisconnected.h.