#include <graph.hpp>
Definition at line 32 of file graph.hpp.
gNode | ( | ) | [inline] |
gNode | ( | T | val | ) | [inline] |
Definition at line 51 of file graph.hpp.
00052 { 00053 this->data =val; //node data 00054 this->vlist=NULL;//next node in list 00055 this->next =NULL;//next neighbor of node 00056 this->me =this;//next occurance of this node 00057 this->start=this;//pointer to this node on the node list 00058 this->m_status =2009; 00059 this->m_aux =0; 00060 }
bool adj | ( | T & | v | ) | [inline] |
int aux | ( | ) | [inline] |
void aux | ( | int | i | ) | [inline] |
Set vertex aux.
Definition at line 97 of file graph.hpp.
Referenced by Graph< T >::push_vertex(), voronoi2dimpl< C, V >::run(), and voronoi2d< C, V >::run().
T get_data | ( | ) | [inline] |
Definition at line 62 of file graph.hpp.
Referenced by voronoi2dimpl< C, V >::run(), and voronoi2d< C, V >::run().
int status | ( | ) | [inline] |
void status | ( | int | i | ) | [inline] |
Get vertex status.
Definition at line 81 of file graph.hpp.
Referenced by Graph< T >::dfs(), Graph< T >::dfs_walk(), and GraphDfsIter< T >::first().
friend class GraphDfsIter< T > [friend] |