This class implements the Minimum Steiner Tree 2-approximation algorithm by Kou et al. More...

#include <ogdf/graphalg/MinSteinerTreeKou.h>

Inheritance diagram for ogdf::MinSteinerTreeKou< T >:

Public Member Functions
	MinSteinerTreeKou ()

virtual	~MinSteinerTreeKou ()

Public Member Functions inherited from ogdf::MinSteinerTreeModule< T >
virtual	~MinSteinerTreeModule ()
	Do nothing on destruction. More...

virtual T	call (const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, EdgeWeightedGraphCopy< T > *&finalSteinerTree)
	Calls the Steiner tree algorithm for nontrivial cases but handles trivial cases directly. More...

Protected Member Functions
void	calculateCompleteGraph (const EdgeWeightedGraph< T > &wG, const List< node > &terminals, EdgeArray< List< edge >> &predecessor, EdgeWeightedGraphCopy< T > &completeTerminalGraph)
	Builds a complete terminal graph. More...

virtual T	computeSteinerTree (const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, EdgeWeightedGraphCopy< T > *&finalSteinerTree) override
	Builds a minimum Steiner tree given a weighted graph and a list of terminals. More...

void	insertPath (const List< edge > &ssspPred, EdgeWeightedGraphCopy< T > &finalSteinerTree, const EdgeWeightedGraph< T > &wG)
	Inserts a shortest path corresponding to an edge in the complete terminal graph. More...

void	reinsertShortestPaths (const EdgeWeightedGraphCopy< T > &completeTerminalGraph, const EdgeArray< List< edge >> &ssspPred, const NodeArray< edge > &mstPred, EdgeWeightedGraphCopy< T > &finalSteinerTree, const EdgeWeightedGraph< T > &wG)
	Swaps an edge in the complete terminal graph with the corresponding shortest path in the original graph. More...

Additional Inherited Members
Static Public Member Functions inherited from ogdf::MinSteinerTreeModule< T >
static void	getNonterminals (ArrayBuffer< node > &nonterminals, const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal)
	Generates a list (as ArrayBuffer<node>) of all nonterminals. More...

static void	getTerminals (List< node > &terminals, const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal)
	Generates a list (as List<node>) of all terminals. More...

static bool	isQuasiBipartite (const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal)
	Checks in O(n + m) time if a given Steiner tree problem instance is quasi-bipartite. More...

static bool	isSteinerTree (const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, const EdgeWeightedGraphCopy< T > &steinerTree)
	Checks in O(n) time if a given tree is acually a Steiner Tree. More...

static void	sortTerminals (List< node > &terminals)
	Sort terminals by index. More...

static T	pruneAllDanglingSteinerPaths (EdgeWeightedGraphCopy< T > &steinerTree, const NodeArray< bool > &isTerminal)
	Prunes nonterminal leaves and their paths to terminal or branching nodes. More...

static T	pruneDanglingSteinerPathFrom (EdgeWeightedGraphCopy< T > &steinerTree, const NodeArray< bool > &isTerminal, node start)
	Prunes the dangling Steiner path beginning at a given nonterminal leaf only. More...

static T	pruneDanglingSteinerPathsFrom (EdgeWeightedGraphCopy< T > &steinerTree, const NodeArray< bool > &isTerminal, const List< node > &start)
	Prunes dangling Steiner paths beginning at given nonterminal leaves only. More...

static T	removeCyclesFrom (EdgeWeightedGraphCopy< T > &steinerTree, const NodeArray< bool > &isTerminal)
	Remove remaining cycles from a Steiner "almost" tree. More...

static void	singleSourceShortestPathsPreferringTerminals (const EdgeWeightedGraph< T > &G, node source, const NodeArray< bool > &isTerminal, NodeArray< T > &distance, NodeArray< edge > &pred)
	Modified single-source-shortest-paths (Dijkstra) with heuristic to prefer paths over terminals. More...

static void	singleSourceShortestPathsStandard (const EdgeWeightedGraph< T > &G, node source, const NodeArray< bool > &, NodeArray< T > &distance, NodeArray< edge > &pred)
	Standard single-source-shortest-paths algoritm (Dijkstra) More...

static void	singleSourceShortestPaths (const EdgeWeightedGraph< T > &G, node source, const NodeArray< bool > &isTerminal, NodeArray< T > &distance, NodeArray< edge > &pred)
	The default single-source-shortest-paths algorithm. More...

static void	allTerminalShortestPathsStandard (const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T >> &distance, NodeArray< NodeArray< edge >> &pred)
	Runs singleSourceShortestPathsStandard from all terminals. More...

static void	allTerminalShortestPathsPreferringTerminals (const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T >> &distance, NodeArray< NodeArray< edge >> &pred)
	Runs singleSourceShortestPathsPreferringTerminals from all terminals. More...

static void	allTerminalShortestPaths (const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T >> &distance, NodeArray< NodeArray< edge >> &pred, std::function< void(const EdgeWeightedGraph< T > &, node, const NodeArray< bool > &, NodeArray< T > &, NodeArray< edge > &)> ssspFunc=singleSourceShortestPaths)
	Runs a given (or the default) single-source-shortest-paths function from all terminals. More...

static void	allNodeShortestPathsStandard (const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T >> &distance, NodeArray< NodeArray< edge >> &pred)
	Runs singleSourceShortestPathsStandard from all nodes. More...

static void	allNodeShortestPathsPreferringTerminals (const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T >> &distance, NodeArray< NodeArray< edge >> &pred)
	Runs singleSourceShortestPathsPreferringTerminals from all nodes. More...

static void	allNodeShortestPaths (const EdgeWeightedGraph< T > &G, const List< node > &terminals, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T >> &distance, NodeArray< NodeArray< edge >> &pred, std::function< void(const EdgeWeightedGraph< T > &, node, const NodeArray< bool > &, NodeArray< T > &, NodeArray< edge > &)> ssspFunc=singleSourceShortestPaths)
	Runs a given (or the default) single-source-shortest-paths function from all nodes. More...

static void	allPairShortestPathsPreferringTerminals (const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T >> &distance, NodeArray< NodeArray< edge >> &pred)
	Modified all-pair-shortest-paths algorithm (Floyd-Warshall) with heuristic to prefer paths over terminals. More...

static void	allPairShortestPathsStandard (const EdgeWeightedGraph< T > &G, const NodeArray< bool > &, NodeArray< NodeArray< T >> &distance, NodeArray< NodeArray< edge >> &pred)
	Standard all-pair-shortest-paths algorithm (Floyd-Warshall) More...

static void	allPairShortestPaths (const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal, NodeArray< NodeArray< T >> &distance, NodeArray< NodeArray< edge >> &pred)
	The default all-pair-shortest-paths algorithm. More...

static void	drawSVG (const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal, const EdgeWeightedGraphCopy< T > &steinerTree, const char *filename)
	Writes an SVG file of a minimum Steiner tree in the original graph. More...

static void	drawSVG (const EdgeWeightedGraph< T > &G, const NodeArray< bool > &isTerminal, const char *filename)
	Writes an SVG file of the instance graph. More...

static void	drawSteinerTreeSVG (const EdgeWeightedGraphCopy< T > &steinerTree, const NodeArray< bool > &isTerminal, const char *filename)
	Writes a SVG that shows only the given Steiner tree. More...

Detailed Description

template<typename T>
class ogdf::MinSteinerTreeKou< T >

This class implements the Minimum Steiner Tree 2-approximation algorithm by Kou et al.

This implementation is based on:

(L. Kou, G. Markowsky, L. Berman, A fast algorithm for Steiner trees, Acta Informatica, volumne 15, number 2, pages 141-145, 1981)

Definition at line 58 of file MinSteinerTreeKou.h.

Constructor & Destructor Documentation

◆ MinSteinerTreeKou()

template<typename T >

ogdf::MinSteinerTreeKou< T >::MinSteinerTreeKou ( )

inline

Definition at line 60 of file MinSteinerTreeKou.h.

◆ ~MinSteinerTreeKou()

template<typename T >

virtual ogdf::MinSteinerTreeKou< T >::~MinSteinerTreeKou ( )

inlinevirtual

Definition at line 62 of file MinSteinerTreeKou.h.

Member Function Documentation

◆ calculateCompleteGraph()

template<typename T >

void ogdf::MinSteinerTreeKou< T >::calculateCompleteGraph	(	const EdgeWeightedGraph< T > &	wG,
		const List< node > &	terminals,
		EdgeArray< List< edge >> &	predecessor,
		EdgeWeightedGraphCopy< T > &	completeTerminalGraph
	)

protected

Builds a complete terminal graph.

Parameters

wG	the original graph
terminals	list of terminals
predecessor	stores for each edge in the complete terminal graph the according path in the original graph
completeTerminalGraph	the resulting complete terminal graph

Definition at line 138 of file MinSteinerTreeKou.h.

◆ computeSteinerTree()

template<typename T >

T ogdf::MinSteinerTreeKou< T >::computeSteinerTree	(	const EdgeWeightedGraph< T > &	G,
		const List< node > &	terminals,
		const NodeArray< bool > &	isTerminal,
		EdgeWeightedGraphCopy< T > *&	finalSteinerTree
	)

overrideprotectedvirtual

Builds a minimum Steiner tree given a weighted graph and a list of terminals.

Parameters

G	The weighted input graph
terminals	The list of terminal nodes
isTerminal	A bool array of terminals
finalSteinerTree	The final Steiner tree

Returns: The objective value (sum of edge costs) of the final Steiner tree

Implements ogdf::MinSteinerTreeModule< T >.

Definition at line 109 of file MinSteinerTreeKou.h.

◆ insertPath()

template<typename T >

void ogdf::MinSteinerTreeKou< T >::insertPath	(	const List< edge > &	ssspPred,
		EdgeWeightedGraphCopy< T > &	finalSteinerTree,
		const EdgeWeightedGraph< T > &	wG
	)

protected

Inserts a shortest path corresponding to an edge in the complete terminal graph.

Parameters

ssspPred	contains for each edge in the complete terminal graph the corresponding path in the original graph
finalSteinerTree	the resulting Steiner tree
wG	the original graph

Definition at line 168 of file MinSteinerTreeKou.h.

◆ reinsertShortestPaths()

template<typename T >

void ogdf::MinSteinerTreeKou< T >::reinsertShortestPaths	(	const EdgeWeightedGraphCopy< T > &	completeTerminalGraph,
		const EdgeArray< List< edge >> &	ssspPred,
		const NodeArray< edge > &	mstPred,
		EdgeWeightedGraphCopy< T > &	finalSteinerTree,
		const EdgeWeightedGraph< T > &	wG
	)

protected

Swaps an edge in the complete terminal graph with the corresponding shortest path in the original graph.

Parameters

completeTerminalGraph	the complete terminal graph
ssspPred	contains for each edge in the complete terminal graph the corresponding path in the original graph
mstPred	predecessor data structure of a minimum terminal spanning tree
finalSteinerTree	the resulting Steiner tree
wG	the original graph

Definition at line 157 of file MinSteinerTreeKou.h.

The documentation for this class was generated from the following file:

include/ogdf/graphalg/MinSteinerTreeKou.h

OpenGraph DrawingFramework

Public Member Functions

Protected Member Functions

Additional Inherited Members

Detailed Description

template<typename T> class ogdf::MinSteinerTreeKou< T >

Constructor & Destructor Documentation

◆ MinSteinerTreeKou()

◆ ~MinSteinerTreeKou()

Member Function Documentation

◆ calculateCompleteGraph()

◆ computeSteinerTree()

◆ insertPath()

◆ reinsertShortestPaths()

Open
Graph Drawing
Framework

template<typename T>
class ogdf::MinSteinerTreeKou< T >