#include <graph.h>

Public Member Functions
	Graph ()
	~Graph ()
	Graph (const Graph &G)
	Graph (Matrix &M)
Graph &	operator= (const Graph &G)
	Graph (std::istream &in)
unsigned	MatsuiBottom (Matrix &edgeIndex)
unsigned	MatsuiBottom (Matrix &edgeIndex, set< unsigned > &someEdges)
unsigned	MatsuiTop (Matrix &edgeIndex)
unsigned	MatsuiTop (Matrix &edgeIndex, set< unsigned > &someEdges)
unsigned	getEdgeIndex (unsigned someEdge, Matrix &edgeIndex)
Graph	subGraph (set< unsigned > &someEdges)
Graph	subGraph (list< vector< unsigned > > &someEdges)
Graph	subGraphDiff (set< unsigned > &someEdges)
Graph	subGraphDiff (list< vector< unsigned > > &someEdges)
Matrix	connComp ()
int	nodesConnected (int, int)
void	readGraph (std::istream &in)
set< unsigned >	randSpanningForest ()
set< unsigned >	randSpanningForest (int &cycleFree)
int	isSpanningForest (list< vector< unsigned > > someEdges)
int	isSpanningForest (set< unsigned > someEdges)
int	isCycleFree (set< unsigned > someEdges)
set< unsigned >	shortestPath (unsigned n1, unsigned n2)
list< vector< unsigned > >	shortestPathList (unsigned n1, unsigned n2)
set< unsigned >	listEdgesToSet (list< vector< unsigned > > &)
int	getNumConnComponents ()
int	rank ()
int	getNumEdges ()
void	deleteDoubleArray (int **, int)
Matrix	FloydWarshall ()
list< set< unsigned > >	NagIbar ()
Matrix	calcEdgeIndex (list< set< unsigned > > &)
int	leftLessThanEqualRight (double a, double b, double c)
void	edgeToNode (unsigned someEdge, unsigned &, unsigned &)
unsigned	edgeNumber (int a, int b)
void	printVertexEdgeMatrix ()
Static Public Member Functions
static void	edgeToNodeEdgeIndex (unsigned someEdge, unsigned &, unsigned &, Matrix &edgeIndex)
Public Attributes
unsigned	findChildrenSpanningTreeCount
unsigned	findChildrenBFSLevel
Protected Member Functions
void	initGraph ()
Protected Attributes
Matrix	adjMatrix
Matrix	nodesToEdgeNumber
map< unsigned, vector< unsigned > >	edges
int	numEdges
int	numNodes
int	numConnComponents
Matrix	transClosure
int	transClosureComputed
int	predMatrixComputed
Matrix	predMatrix
Friends
std::ostream &	operator<< (std::ostream &o, const Graph &G)
std::istream &	operator>> (std::istream &in, Graph &G)
void	findChildren (Graph &G, set< unsigned > &initTree, set< unsigned > &deltaf, set< unsigned > &deltag, set< unsigned > deltaH, Matrix &edgeIndex, unsigned printMod, unsigned printTrees)
void	findChildren (Graph &G, set< unsigned > &initTree, set< unsigned > &deltaf, set< unsigned > &deltag, set< unsigned > deltaH, Matrix &edgeIndex, Matrix &Weight, set< Matrix, ltcolvec > &projTrees, unsigned printMod, unsigned printTrees)

Constructor & Destructor Documentation

Graph::Graph ( )

Graph::~Graph ( )

Graph::Graph ( const Graph & G )

Graph::Graph ( Matrix & M )

Graph::Graph ( std::istream & in )

Member Function Documentation

Matrix Graph::calcEdgeIndex ( list< set< unsigned > > & edgePartition )

Matrix Graph::connComp ( )

void Graph::deleteDoubleArray	(	int **	someArray,
		int	numRows
	)

unsigned Graph::edgeNumber	(	int	a,
		int	b
	)

void Graph::edgeToNode	(	unsigned	someEdge,
		unsigned &	n1,
		unsigned &	n2
	)

void Graph::edgeToNodeEdgeIndex	(	unsigned	someEdge,
		unsigned &	n1,
		unsigned &	n2,
		Matrix &	edgeIndex
	)		`[static]`

Matrix Graph::FloydWarshall ( )

unsigned Graph::getEdgeIndex	(	unsigned	someEdge,
		Matrix &	edgeIndex
	)

int Graph::getNumConnComponents ( )

int Graph::getNumEdges ( )

void Graph::initGraph ( ) [protected]

int Graph::isCycleFree ( set< unsigned > someEdges )

int Graph::isSpanningForest ( list< vector< unsigned > > someEdges )

int Graph::isSpanningForest ( set< unsigned > someEdges )

int Graph::leftLessThanEqualRight	(	double	a,
		double	b,
		double	c
	)

set< unsigned > Graph::listEdgesToSet ( list< vector< unsigned > > & someEdges )

unsigned Graph::MatsuiBottom ( Matrix & edgeIndex )

unsigned Graph::MatsuiBottom	(	Matrix &	edgeIndex,
		set< unsigned > &	someEdges
	)

unsigned Graph::MatsuiTop ( Matrix & edgeIndex )

unsigned Graph::MatsuiTop	(	Matrix &	edgeIndex,
		set< unsigned > &	someEdges
	)

list< set< unsigned > > Graph::NagIbar ( )

int Graph::nodesConnected	(	int	a,
		int	b
	)

Graph & Graph::operator= ( const Graph & G )

void Graph::printVertexEdgeMatrix ( )

set< unsigned > Graph::randSpanningForest ( )

set< unsigned > Graph::randSpanningForest ( int & cycleFree )

int Graph::rank ( )

void Graph::readGraph ( std::istream & in )

set< unsigned > Graph::shortestPath	(	unsigned	n1,
		unsigned	n2
	)

list< vector< unsigned > > Graph::shortestPathList	(	unsigned	n1,
		unsigned	n2
	)

Graph Graph::subGraph ( set< unsigned > & someEdges )

Graph Graph::subGraph ( list< vector< unsigned > > & someEdges )

Graph Graph::subGraphDiff ( set< unsigned > & someEdges )

Graph Graph::subGraphDiff ( list< vector< unsigned > > & someEdges )

Friends And Related Function Documentation

void findChildren	(	Graph &	G,
		set< unsigned > &	initTree,
		set< unsigned > &	deltaf,
		set< unsigned > &	deltag,
		set< unsigned >	deltaH,
		Matrix &	edgeIndex,
		unsigned	printMod,
		unsigned	printTrees
	)		`[friend]`

void findChildren	(	Graph &	G,
		set< unsigned > &	initTree,
		set< unsigned > &	deltaf,
		set< unsigned > &	deltag,
		set< unsigned >	deltaH,
		Matrix &	edgeIndex,
		Matrix &	Weight,
		set< Matrix, ltcolvec > &	projTrees,
		unsigned	printMod,
		unsigned	printTrees
	)		`[friend]`