extended_graph_alg.h File Reference

Declaration of extended graph algorithms. More...

#include <ogdf/basic/Array.h>
#include <ogdf/basic/DisjointSets.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphCopy.h>
#include <ogdf/basic/GraphList.h>
#include <ogdf/basic/PriorityQueue.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/comparer.h>
#include <ogdf/basic/internal/config_autogen.h>
#include <ogdf/basic/internal/graph_iterators.h>
#include <ogdf/planarity/BoyerMyrvold.h>

Go to the source code of this file.

Namespaces
namespace	ogdf
	The namespace for all OGDF objects.

Functions
template<class NODELISTITERATOR , class EDGELIST >
void	ogdf::inducedSubgraph (Graph &G, NODELISTITERATOR &it, EDGELIST &E)
	Computes the edges in a node-induced subgraph.
bool	ogdf::isPlanar (const Graph &G)
	Returns true, if G is planar, false otherwise.
bool	ogdf::isSTPlanar (const Graph &graph, const node s, const node t)
	Returns whether G is s-t-planar (i.e.
bool	ogdf::planarEmbed (Graph &G)
	Returns true, if G is planar, false otherwise. If true is returned, G will be planarly embedded.
bool	ogdf::planarEmbedPlanarGraph (Graph &G)
	Constructs a planar embedding of G. It assumes that G is planar!
bool	ogdf::planarSTEmbed (Graph &graph, node s, node t)
	s-t-planarly embeds a graph.
Methods for clustered graphs
bool	ogdf::isCConnected (const ClusterGraph &C)
	Returns true iff cluster graph C is c-connected.
void	ogdf::makeCConnected (ClusterGraph &C, Graph &G, List< edge > &addedEdges, bool simple=true)
	Makes a cluster graph c-connected by adding edges.
Methods for minimum spanning tree computation
template<typename T >
T	ogdf::computeMinST (const Graph &G, const EdgeArray< T > &weight, EdgeArray< bool > &isInTree)
	Computes a minimum spanning tree using Prim's algorithm.
template<typename T >
void	ogdf::computeMinST (const Graph &G, const EdgeArray< T > &weight, NodeArray< edge > &pred)
	Computes a minimum spanning tree (MST) using Prim's algorithm.
template<typename T >
T	ogdf::computeMinST (const Graph &G, const EdgeArray< T > &weight, NodeArray< edge > &pred, EdgeArray< bool > &isInTree)
	Computes a minimum spanning tree (MST) using Prim's algorithm.
template<typename T >
void	ogdf::computeMinST (node s, const Graph &G, const EdgeArray< T > &weight, NodeArray< edge > &pred)
	Computes a minimum spanning tree (MST) using Prim's algorithm.
template<typename T >
T	ogdf::computeMinST (node s, const Graph &G, const EdgeArray< T > &weight, NodeArray< edge > &pred, EdgeArray< bool > &isInTree)
	Computes a minimum spanning tree (MST) using Prim's algorithm.
template<typename T >
T	ogdf::makeMinimumSpanningTree (Graph &G, const EdgeArray< T > &weight)
	Reduce a graph to its minimum spanning tree (MST) using Kruskal's algorithm.

Detailed Description

Declaration of extended graph algorithms.

Author

Sebastian Leipert, Karsten Klein, Markus Chimani

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