Collaboration diagram for ecolab::NautyRep:

Public Types
typedef Rep_const_iterator< NautyRep >	const_iterator

Public Member Functions
const_iterator	begin () const

const_iterator	end () const

unsigned	m () const

unsigned	mw () const

	NautyRep (unsigned nodes)

	NautyRep (const Graph &x)

	NautyRep (const DiGraph &x)

	NautyRep (const BiDirectionalGraph &x)

	NautyRep (const BitRep &x)

	NautyRep (const BiDirectionalBitRep &x)

const NautyRep &	operator= (const Graph &x)

const NautyRep &	operator= (const DiGraph &x)

const NautyRep &	operator= (const BiDirectionalGraph &x)

const NautyRep &	operator= (const BitRep &x)

const NautyRep &	operator= (const BiDirectionalBitRep &x)

bitref	operator() (unsigned i, unsigned j)

const_bitref	operator() (unsigned i, unsigned j) const

unsigned	nodes () const
	number of nodes this graph has

unsigned	links () const
	number of links this graph has

bool	operator== (const NautyRep &x) const
	next permutation of links - returns false if no further permutations

bool	operator!= (const NautyRep &x) const

bool	operator< (const NautyRep &x) const

double	lnomega () const
	log of the number of bitstrings equivalent to this graph

NautyRep	canonicalise () const

bool	contains (const Edge &e) const

void	push_back (const Edge &e)

void	clear (unsigned nodes=0)

Friends
void	ecolab_nauty (const NautyRep &, NautyRep &, double &, bool, int)
	EcoLab interface to Nauty. More...

Detailed Description

a directed graph with the linklist represented by a bitvector

Member Function Documentation

NautyRep ecolab::NautyRep::canonicalise ( ) const

canonical form of this graph - same graph is return for all equivalent graphs

friend

EcoLab interface to Nauty.

Parameters

g	Graph the analyse
canonical	returned canonical representation
lnomega	$\ln\Omega$
do_canonical	whether to compute a canonical rep, or just $\ln\Omega$

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