DecompGraph Class Reference

#include <decomp.h>

List of all members.

Public Member Functions
	DecompGraph ()
	Standard-Constructor.
	DecompGraph (const SparsityInfo &si)
virtual	~DecompGraph ()
map< int, Node >::iterator	add_node (int index, int weight=0)
set< Edge >::iterator	add_edge (map< int, Node >::iterator node1, map< int, Node >::iterator node2, int weight=0)
set< Edge >::iterator	add_edge (int node1, int node2, int weight=0)
int	n () const
	The number of nodes.
int	m () const
	The number of edges.
void	compute_connected_components ()
void	get_component_members (vector< list< int > > &members)
void	compute_partition (int nparts)
Public Attributes
map< int, Node >	nodes
set< Edge >	edges
int	nrcomp
int	largest_size
	The size of the largest component.
Friends
ostream &	operator<< (ostream &out, const DecompGraph &g)
	Prints the graph.
Classes
class	Edge
class	Node

---

Detailed Description

Definition at line 14 of file decomp.h.

---

Constructor & Destructor Documentation

DecompGraph::DecompGraph

(

)

[inline]

Standard-Constructor.

Constructs an empty graph.

Definition at line 79 of file decomp.h.

DecompGraph::DecompGraph

(

const SparsityInfo &

si

)

virtual DecompGraph::~DecompGraph

(

)

[inline, virtual]

Definition at line 85 of file decomp.h.

---

Member Function Documentation

map<int, Node>::iterator DecompGraph::add_node	(	int	index,
		int	weight = 0
	)

set<Edge>::iterator DecompGraph::add_edge	(	map< int, Node >::iterator	node1,
		map< int, Node >::iterator	node2,
		int	weight = 0
	)

set<Edge>::iterator DecompGraph::add_edge	(	int	node1,
		int	node2,
		int	weight = 0
	)

int DecompGraph::n

(

)

const [inline]

The number of nodes.

Returns:

Then number of nodes: nodes.size().

Definition at line 95 of file decomp.h.

References nodes.

int DecompGraph::m

(

)

const [inline]

The number of edges.

Returns:

The number of edges: edges.size().

Definition at line 100 of file decomp.h.

References edges.

void DecompGraph::compute_connected_components

(

)

void DecompGraph::get_component_members

(

vector< list< int > > &

members

)

void DecompGraph::compute_partition

(

int

nparts

)

---

Friends And Related Function Documentation

ostream& operator<<	(	ostream &	out,
		const DecompGraph &	g
	)			[friend]

Prints the graph.

Parameters:

	out	The ostream to print to.
	g	The DecompGraph to print.

Returns:

The ostream out.

---

Member Data Documentation

map<int, Node> DecompGraph::nodes

Definition at line 68 of file decomp.h.

Referenced by n().

set<Edge> DecompGraph::edges

Definition at line 69 of file decomp.h.

Referenced by m().

int DecompGraph::nrcomp

Definition at line 71 of file decomp.h.

int DecompGraph::largest_size

The size of the largest component.

Definition at line 74 of file decomp.h.

---

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

• decomp.h

---