sspt_Graph< N, E > Class Template Reference

basic graph data structure with support to label nodes and edges More...

#include <sspt_graph.h>

List of all members.

Classes

struct  Edge
class  RemovePredicate

Public Member Functions

 sspt_Graph ()
 ~sspt_Graph ()
int addNode (N item)
bool addNode (int nodeId, N item)
bool addEdge (int nodeA, int nodeB, E item)
bool removeEdge (int nodeA, int nodeB)
void getNodes (sspt_List< int > *nodes)
bool getNode (int nodeId, N *buffer)
bool getEdge (int *edgeId, E *buffer, int nodeA, int nodeB)
bool getEdge (int edgeId, E *buffer)
void getEdges (sspt_List< int > *edges)
bool getEdges (int nodeId, sspt_List< int > *edges)
bool getConnectedNodes (int nodeId, sspt_List< int > *nodes)
bool isEdge (int nodeA, int nodeB)
bool getEdgeNodes (int edgeId, int *nodeA, int *nodeB)


Detailed Description

template<class N, class E>
class sspt_Graph< N, E >

basic graph data structure with support to label nodes and edges

Constructor & Destructor Documentation

template<class N , class E >
sspt_Graph< N, E >::sspt_Graph (  )  [inline]

template<class N , class E >
sspt_Graph< N, E >::~sspt_Graph (  )  [inline]


Member Function Documentation

template<class N , class E >
bool sspt_Graph< N, E >::addEdge ( int  nodeA,
int  nodeB,
item 
) [inline]

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

template<class N , class E >
int sspt_Graph< N, E >::addNode ( item  )  [inline]

template<class N , class E >
bool sspt_Graph< N, E >::getConnectedNodes ( int  nodeId,
sspt_List< int > *  nodes 
) [inline]

template<class N , class E >
bool sspt_Graph< N, E >::getEdge ( int  edgeId,
E *  buffer 
) [inline]

template<class N , class E >
bool sspt_Graph< N, E >::getEdge ( int *  edgeId,
E *  buffer,
int  nodeA,
int  nodeB 
) [inline]

template<class N , class E >
bool sspt_Graph< N, E >::getEdgeNodes ( int  edgeId,
int *  nodeA,
int *  nodeB 
) [inline]

template<class N , class E >
bool sspt_Graph< N, E >::getEdges ( int  nodeId,
sspt_List< int > *  edges 
) [inline]

template<class N , class E >
void sspt_Graph< N, E >::getEdges ( sspt_List< int > *  edges  )  [inline]

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

template<class N , class E >
void sspt_Graph< N, E >::getNodes ( sspt_List< int > *  nodes  )  [inline]

template<class N , class E >
bool sspt_Graph< N, E >::isEdge ( int  nodeA,
int  nodeB 
) [inline]

template<class N , class E >
bool sspt_Graph< N, E >::removeEdge ( int  nodeA,
int  nodeB 
) [inline]


doxygen