Main Page | Namespace List | Class Hierarchy | Class List | File List | Namespace Members | Class Members | File Members | Related Pages

node Class Reference

Nodes to be stored within a graph. More...

#include <graph.h>

Inheritance diagram for node:

Inheritance graph
[legend]
Collaboration diagram for node:

Collaboration graph
[legend]
List of all members.

Public Member Functions

 node (const char *)
graph_objectclone () const
const char * getName () const
unsigned int getNum () const
int getUniqueID () const
void addEdge (edge *)
void removeEdge (edge *)
edgeedgeIterNextIncoming (edge_iterator &) const
edge_iterator getIncomingEdgeIter () const
edgeedgeIterNextOutgoing (edge_iterator &) const
edge_iterator getOutgoingEdgeIter () const
edgeedgeIterNext (edge_iterator &) const
edge_iterator getEdgeIter () const
edgegetEdge (unsigned int which)
neighbor_iterator getNeighborIter () const
int nodeNeighborNext (neighbor_iterator &) const
edgegetRandomIncomingEdge ()
edgegetRandomOutgoingEdge ()
edgegetRandomEdge ()
int getNumOutgoingEdges ()
int getNumIncomingEdges ()
int getNumEdges ()
void setKeyLabel (int which)
double getKey ()
void setLabelF (unsigned int index, double val)
void setLabelL (unsigned int index, long val)
double getLabelF (unsigned int index)
long getLabelL (unsigned int index)
void markEdge (edge *e)
edgegetMarkedEdge ()
double getWidth ()
void setWidth (double val)
void Print (std::ostream &) const

Private Attributes

unsigned int nodeNum
std::vector< labelValuelabel
edgemarkedEdge
std::vector< edge * > _edgesOutgoing
std::vector< edge * > _edgesIncoming
std::vector< edge * > _allEdges
char name [30]
int keyLabel
double width
int uniqueID

Static Private Attributes

unsigned int uniqueIDCounter = 0

Friends

class graph

Detailed Description

Nodes to be stored within a graph.


Constructor & Destructor Documentation

node::node const char *   ) 
 


Member Function Documentation

void node::addEdge edge  ) 
 

graph_object * node::clone  )  const [virtual]
 

Implements graph_object.

edge * node::edgeIterNext edge_iterator  )  const
 

edge * node::edgeIterNextIncoming edge_iterator  )  const
 

edge * node::edgeIterNextOutgoing edge_iterator  )  const
 

edge * node::getEdge unsigned int  which  ) 
 

edge_iterator node::getEdgeIter  )  const
 

edge_iterator node::getIncomingEdgeIter  )  const
 

double node::getKey  )  [inline, virtual]
 

Reimplemented from graph_object.

double node::getLabelF unsigned int  index  )  [inline]
 

long node::getLabelL unsigned int  index  )  [inline]
 

edge* node::getMarkedEdge  )  [inline]
 

const char* node::getName  )  const [inline]
 

neighbor_iterator node::getNeighborIter  )  const
 

unsigned int node::getNum  )  const [inline]
 

int node::getNumEdges  )  [inline]
 

int node::getNumIncomingEdges  ) 
 

int node::getNumOutgoingEdges  ) 
 

edge_iterator node::getOutgoingEdgeIter  )  const
 

edge * node::getRandomEdge  ) 
 

edge * node::getRandomIncomingEdge  ) 
 

edge * node::getRandomOutgoingEdge  ) 
 

int node::getUniqueID  )  const [inline]
 

double node::getWidth  )  [inline]
 

void node::markEdge edge e  )  [inline]
 

int node::nodeNeighborNext neighbor_iterator  )  const
 

void node::Print std::ostream &   )  const [virtual]
 

Reimplemented from graph_object.

void node::removeEdge edge  ) 
 

void node::setKeyLabel int  which  )  [inline]
 

void node::setLabelF unsigned int  index,
double  val
 

void node::setLabelL unsigned int  index,
long  val
 

void node::setWidth double  val  )  [inline]
 


Friends And Related Function Documentation

friend class graph [friend]
 


Member Data Documentation

std::vector<edge *> node::_allEdges [private]
 

std::vector<edge *> node::_edgesIncoming [private]
 

std::vector<edge *> node::_edgesOutgoing [private]
 

int node::keyLabel [private]
 

std::vector<labelValue> node::label [private]
 

edge* node::markedEdge [private]
 

char node::name[30] [private]
 

unsigned int node::nodeNum [private]
 

int node::uniqueID [private]
 

unsigned node::uniqueIDCounter = 0 [static, private]
 

double node::width [private]
 


The documentation for this class was generated from the following files:
Generated on Tue Aug 18 03:43:57 2009 for HOG by doxygen 1.3.4