sspt_Digraph< N, E > Class Template Reference

basic digraph data structure with capability to label nodes and edges More...

#include <sspt_digraph.h>

List of all members.

Classes
struct	Arc
class	RemovePredicate
Public Member Functions
	sspt_Digraph ()
	~sspt_Digraph ()
int	addNode (N item)
bool	addNode (int nodeId, N item)
bool	addArc (int nodeA, int nodeB, E item)
bool	removeArc (int nodeA, int nodeB, int arcId)
void	getNodes (sspt_List< int > *nodes)
bool	getNode (int nodeId, N *buffer)
bool	getArcs (int nodeA, int nodeB, sspt_List< int > *arcs)
bool	getArc (int arcId, E *buffer, int *fromNode, int *toNode)
void	getArcs (sspt_List< int > *arcs)
bool	getArcs (int nodeId, sspt_List< int > *arcs)
bool	isArc (int nodeA, int nodeB)
bool	getArcDest (int arcId, int *nodeId)
bool	connectedComponents (sspt_List< sspt_Digraph< N, E > * > *list)

---

Detailed Description

template<class N, class E>
class sspt_Digraph< N, E >

basic digraph data structure with capability to label nodes and edges

---

Constructor & Destructor Documentation

template<class N , class E >

sspt_Digraph< N, E >::sspt_Digraph

(

)

[inline]

template<class N , class E >

sspt_Digraph< N, E >::~sspt_Digraph

(

)

[inline]

---

Member Function Documentation

template<class N , class E >

bool sspt_Digraph< N, E >::addArc	(	int	nodeA,
		int	nodeB,
		E	item
	)			[inline]

template<class N , class E >

bool sspt_Digraph< N, E >::addNode	(	int	nodeId,
		N	item
	)			[inline]

template<class N , class E >

int sspt_Digraph< N, E >::addNode

(

N

item

)

[inline]

template<class N , class E >

bool sspt_Digraph< N, E >::connectedComponents

(

sspt_List< sspt_Digraph< N, E > * > *

list

)

[inline]

template<class N , class E >

bool sspt_Digraph< N, E >::getArc	(	int	arcId,
		E *	buffer,
		int *	fromNode,
		int *	toNode
	)			[inline]

template<class N , class E >

bool sspt_Digraph< N, E >::getArcDest	(	int	arcId,
		int *	nodeId
	)			[inline]

template<class N , class E >

bool sspt_Digraph< N, E >::getArcs	(	int	nodeId,
		sspt_List< int > *	arcs
	)			[inline]

template<class N , class E >

void sspt_Digraph< N, E >::getArcs

(

sspt_List< int > *

arcs

)

[inline]

template<class N , class E >

bool sspt_Digraph< N, E >::getArcs	(	int	nodeA,
		int	nodeB,
		sspt_List< int > *	arcs
	)

template<class N , class E >

bool sspt_Digraph< N, E >::getNode	(	int	nodeId,
		N *	buffer
	)			[inline]

template<class N , class E >

void sspt_Digraph< N, E >::getNodes

(

sspt_List< int > *

nodes

)

[inline]

template<class N , class E >

bool sspt_Digraph< N, E >::isArc	(	int	nodeA,
		int	nodeB
	)			[inline]

template<class N , class E >

bool sspt_Digraph< N, E >::removeArc	(	int	nodeA,
		int	nodeB,
		int	arcId
	)			[inline]