Partition< GraphTyp > Class Template Reference

Represents a partition of a graph.

#include <partition.h>

Public Member Functions
	Partition ()
	Partition (GraphTyp &G)
bool	same_block (vertex_descriptor v, vertex_descriptor w)
void	union_blocks (vertex_descriptor v, vertex_descriptor w)
	Partition (const Partition &orig)
Friends
template<typename T >
std::ostream &	operator<< (std::ostream &os, Partition< T > const &rhs)

Detailed Description

Definition at line 13 of file partition.h.

template<typename GraphTyp >

Partition< GraphTyp >::Partition ( ) [inline]

Creates an empty partition

Definition at line 58 of file partition.h.

template<typename GraphTyp >

Partition< GraphTyp >::Partition ( GraphTyp & G ) [inline]

Creates a new partition of an graph. The partition is initialised with each node representing its own set.

Definition at line 37 of file partition.h.

template<typename GraphTyp >

Partition< GraphTyp >::Partition ( const Partition< GraphTyp > & orig ) [inline]

Copy constructor

Definition at line 63 of file partition.h.

template<typename GraphTyp >

bool Partition< GraphTyp >::same_block	(	vertex_descriptor	v,
		vertex_descriptor	w
	)			`[inline]`

Tests if two vertices v,w belong to the same set.

Definition at line 44 of file partition.h.

template<typename GraphTyp >

void Partition< GraphTyp >::union_blocks	(	vertex_descriptor	v,
		vertex_descriptor	w
	)			`[inline]`

Merges the sets represented by vertices v,w

Definition at line 50 of file partition.h.

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