ogdf::ConnectedSubgraph< T > Class Template Reference

#include <ogdf/internal/planarity/ConnectedSubgraph.h>

List of all members.

Public Member Functions
	ConnectedSubgraph ()
Static Public Member Functions
static void	call (const Graph &G, Graph &SG, const node &nG, node &nSG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG)
	Computes a connected subgraph SG of G containing node nG.
static void	call (const Graph &G, Graph &SG, const node &nG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG, NodeArray< node > &nG_to_nSG)
	Computes a connected subgraph SG of G containing node nG.
static void	call (const Graph &G, Graph &SG, const node &nG, node &nSG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG, const EdgeArray< T > &edgeLengthG, EdgeArray< T > &edgeLengthSG)
	Computes a connected subgraph SG of G containing node nG.
static void	call (const Graph &G, Graph &SG, const node &nG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG)
	Computes a connected subgraph SG of G containing node nG.
static void	call (const Graph &G, Graph &SG, const node &nG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG, const EdgeArray< T > &edgeLengthG, EdgeArray< T > &edgeLengthSG)
	Computes a connected subgraph SG of G containing node nG.
static void	call (const Graph &G, Graph &SG, const node &nG, node &nSG, NodeArray< node > &nSG_to_nG, EdgeArray< edge > &eSG_to_eG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG, const EdgeArray< T > &edgeLengthG, EdgeArray< T > &edgeLengthSG)
	Computes a connected subgraph SG of G containing node nG.
static void	call (const Graph &G, Graph &SG, const node &nG, node &nSG, NodeArray< node > &nSG_to_nG, EdgeArray< edge > &eSG_to_eG, NodeArray< node > &nG_to_nSG, EdgeArray< edge > &eG_to_eSG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG, const EdgeArray< T > &edgeLengthG, EdgeArray< T > &edgeLengthSG)
	Computes a connected subgraph SG of G containing node nG.
static void	call (const Graph &G, Graph &SG, const node &nG, NodeArray< node > &nSG_to_nG, EdgeArray< edge > &eSG_to_eG, NodeArray< node > &nG_to_nSG, EdgeArray< edge > &eG_to_eSG)
	Computes a connected subgraph SG of G containing node nG.
static void	call (const Graph &G, Graph &SG, const node &nG, NodeArray< node > &nSG_to_nG)
	Computes a connected subgraph SG of G containing node nG.
Static Private Member Functions
static void	recursion (Graph &SG, bool *nodeVisited, bool *edgeVisited, const node &nG, const NodeArray< T > &nodeLengthG, NodeArray< T > &nodeLengthSG, const EdgeArray< T > &edgeLengthG, EdgeArray< T > &edgeLengthSG, NodeArray< node > &nSG_to_nG, EdgeArray< edge > &eSG_to_eG, NodeArray< node > &nG_to_nSG, EdgeArray< edge > &eG_to_eSG)
	Copies to SG node nG and recursively all adjacent edges and nodes.

---

Detailed Description

template<class T>
class ogdf::ConnectedSubgraph< T >

Definition at line 65 of file ConnectedSubgraph.h.

---

Constructor & Destructor Documentation

template<class T >

ogdf::ConnectedSubgraph< T >::ConnectedSubgraph

(

)

[inline]

Definition at line 69 of file ConnectedSubgraph.h.

---

Member Function Documentation

template<class T >

static void ogdf::ConnectedSubgraph< T >::call	(	const Graph &	G,
		Graph &	SG,
		const node &	nG,
		node &	nSG,
		const NodeArray< T > &	nodeLengthG,
		NodeArray< T > &	nodeLengthSG
	)			[inline, static]

Computes a connected subgraph SG of G containing node nG.

Parameters:

	G	is the original graph.
	return	SG is the connected subgraph containing nG.
	nG	is a node in G.
	return	nSG is the corresponding node of nG in SG.
	nodeLengthG	is saving for each node of G its length.
	return	nodeLengthSG is saving for each node of SG its length.

Definition at line 80 of file ConnectedSubgraph.h.

template<class T >

static void ogdf::ConnectedSubgraph< T >::call	(	const Graph &	G,
		Graph &	SG,
		const node &	nG,
		const NodeArray< T > &	nodeLengthG,
		NodeArray< T > &	nodeLengthSG,
		NodeArray< node > &	nG_to_nSG
	)			[inline, static]

Computes a connected subgraph SG of G containing node nG.

Parameters:

	G	is the original graph.
	return	SG is the connected subgraph containing nG.
	nG	is a node in G.
	nodeLengthG	is saving for each node of G its length.
	return	nodeLengthSG is saving for each node of SG its length.
	return	nG_to_nSG is a mapping of nodes in G to nodes in SG.

Definition at line 101 of file ConnectedSubgraph.h.

template<class T >

static void ogdf::ConnectedSubgraph< T >::call	(	const Graph &	G,
		Graph &	SG,
		const node &	nG,
		NodeArray< node > &	nSG_to_nG
	)			[inline, static]

Computes a connected subgraph SG of G containing node nG.

Parameters:

	G	is the original graph.
	return	SG is the connected subgraph containing nG.
	nG	is a node in G.
	nSG_to_nG	is mapping nodes in SG to nodes in G

Definition at line 267 of file ConnectedSubgraph.h.

template<class T >

static void ogdf::ConnectedSubgraph< T >::call	(	const Graph &	G,
		Graph &	SG,
		const node &	nG,
		const NodeArray< T > &	nodeLengthG,
		NodeArray< T > &	nodeLengthSG
	)			[inline, static]

Computes a connected subgraph SG of G containing node nG.

Parameters:

	G	is the original graph.
	return	SG is the connected subgraph containing nG.
	nG	is a node in G.
	nodeLengthG	is saving for each node of G its length.
	return	nodeLengthSG is saving for each node of SG its length.

Definition at line 152 of file ConnectedSubgraph.h.

template<class T >

void ogdf::ConnectedSubgraph< T >::call	(	const Graph &	G,
		Graph &	SG,
		const node &	nG,
		node &	nSG,
		NodeArray< node > &	nSG_to_nG,
		EdgeArray< edge > &	eSG_to_eG,
		NodeArray< node > &	nG_to_nSG,
		EdgeArray< edge > &	eG_to_eSG,
		const NodeArray< T > &	nodeLengthG,
		NodeArray< T > &	nodeLengthSG,
		const EdgeArray< T > &	edgeLengthG,
		EdgeArray< T > &	edgeLengthSG
	)			[static]

Computes a connected subgraph SG of G containing node nG.

Parameters:

	G	is the original graph.
	return	SG is the connected subgraph containing nG.
	nG	is a node in G.
	return	SG is the connected subgraph containing nG.
	nSG_to_nG	is mapping nodes in SG to nodes in G
	eSG_to_eG	is mapping edges in SG to edges in G
	nG_to_nSG	is mapping nodes in G to nodes in SG
	eG_to_eSG	is mapping edges in G to edges in SG
	nodeLengthG	is saving for each node of G its length.
	return	nodeLengthSG is saving for each node of SG its length.
	edgeLengthG	is saving for each edge of G its length.
	return	edgeLengthSG is saving for each edge of SG its length.

Definition at line 360 of file ConnectedSubgraph.h.

template<class T >

static void ogdf::ConnectedSubgraph< T >::call	(	const Graph &	G,
		Graph &	SG,
		const node &	nG,
		node &	nSG,
		NodeArray< node > &	nSG_to_nG,
		EdgeArray< edge > &	eSG_to_eG,
		const NodeArray< T > &	nodeLengthG,
		NodeArray< T > &	nodeLengthSG,
		const EdgeArray< T > &	edgeLengthG,
		EdgeArray< T > &	edgeLengthSG
	)			[inline, static]

Computes a connected subgraph SG of G containing node nG.

Parameters:

	G	is the original graph.
	return	SG is the connected subgraph containing nG.
	nG	is a node in G.
	return	SG is the connected subgraph containing nG.
	nSG_to_nG	is mapping nodes in SG to nodes in G
	eSG_to_eG	is mapping edges in SG to edges in G
	nodeLengthG	is saving for each node of G its length.
	return	nodeLengthSG is saving for each node of SG its length.
	edgeLengthG	is saving for each edge of G its length.
	return	edgeLengthSG is saving for each edge of SG its length.

Definition at line 197 of file ConnectedSubgraph.h.

template<class T >

static void ogdf::ConnectedSubgraph< T >::call	(	const Graph &	G,
		Graph &	SG,
		const node &	nG,
		const NodeArray< T > &	nodeLengthG,
		NodeArray< T > &	nodeLengthSG,
		const EdgeArray< T > &	edgeLengthG,
		EdgeArray< T > &	edgeLengthSG
	)			[inline, static]

Computes a connected subgraph SG of G containing node nG.

Parameters:

	G	is the original graph.
	return	SG is the connected subgraph containing nG.
	nG	is a node in G.
	nodeLengthG	is saving for each node of G its length.
	return	nodeLengthSG is saving for each node of SG its length.
	edgeLengthG	is saving for each edge of G its length.
	return	edgeLengthSG is saving for each edge of SG its length.

Definition at line 172 of file ConnectedSubgraph.h.

template<class T >

void ogdf::ConnectedSubgraph< T >::call	(	const Graph &	G,
		Graph &	SG,
		const node &	nG,
		NodeArray< node > &	nSG_to_nG,
		EdgeArray< edge > &	eSG_to_eG,
		NodeArray< node > &	nG_to_nSG,
		EdgeArray< edge > &	eG_to_eSG
	)			[static]

Computes a connected subgraph SG of G containing node nG.

Parameters:

	G	is the original graph.
	return	SG is the connected subgraph containing nG.
	nG	is a node in G.
	nSG_to_nG	is mapping nodes in SG to nodes in G
	eSG_to_eG	is mapping edges in SG to edges in G
	nG_to_nSG	is mapping nodes in G to nodes in SG
	eG_to_eSG	is mapping edges in G to edges in SG

Definition at line 398 of file ConnectedSubgraph.h.

template<class T >

static void ogdf::ConnectedSubgraph< T >::call	(	const Graph &	G,
		Graph &	SG,
		const node &	nG,
		node &	nSG,
		const NodeArray< T > &	nodeLengthG,
		NodeArray< T > &	nodeLengthSG,
		const EdgeArray< T > &	edgeLengthG,
		EdgeArray< T > &	edgeLengthSG
	)			[inline, static]

Computes a connected subgraph SG of G containing node nG.

Parameters:

	G	is the original graph.
	return	SG is the connected subgraph containing nG.
	nG	is a node in G.
	return	nSG is the corresponding node of nG in SG.
	nodeLengthG	is saving for each node of G its length.
	return	nodeLengthSG is saving for each node of SG its length.
	edgeLengthG	is saving for each edge of G its length.
	return	edgeLengthSG is saving for each edge of SG its length.

Definition at line 129 of file ConnectedSubgraph.h.

template<class T >

void ogdf::ConnectedSubgraph< T >::recursion	(	Graph &	SG,
		bool *	nodeVisited,
		bool *	edgeVisited,
		const node &	nG,
		const NodeArray< T > &	nodeLengthG,
		NodeArray< T > &	nodeLengthSG,
		const EdgeArray< T > &	edgeLengthG,
		EdgeArray< T > &	edgeLengthSG,
		NodeArray< node > &	nSG_to_nG,
		EdgeArray< edge > &	eSG_to_eG,
		NodeArray< node > &	nG_to_nSG,
		EdgeArray< edge > &	eG_to_eSG
	)			[static, private]

Copies to SG node nG and recursively all adjacent edges and nodes.

Parameters:

	SG	is the connected subgraph.
	nodeVisited	saves for all nodes in G, if they were already treated.
	edgeVisited	saves for all edges in G, if they were already treated.
	nG	is a node in G.
	nodeLengthG	is saving for each node of G its length.
	nodeLengthSG	is saving for each node of SG its length.
	edgeLengthG	is saving for each edge of G its length.
	edgeLengthSG	is saving for each edge of SG its length.
	nSG_to_nG	is mapping nodes in SG to nodes in G
	eSG_to_eG	is mapping edges in SG to edges in G
	nG_to_nSG	is mapping nodes in G to nodes in SG
	eG_to_eSG	is mapping edges in G to edges in SG

Definition at line 317 of file ConnectedSubgraph.h.

---

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

• ogdf/internal/planarity/ConnectedSubgraph.h