#include <graph.h>
Inheritance diagram for node:
Public Member Functions | |
node (const char *) | |
graph_object * | clone () const |
const char * | getName () const |
unsigned int | getNum () const |
int | getUniqueID () const |
void | addEdge (edge *) |
void | removeEdge (edge *) |
edge * | edgeIterNextIncoming (edge_iterator &) const |
edge_iterator | getIncomingEdgeIter () const |
edge * | edgeIterNextOutgoing (edge_iterator &) const |
edge_iterator | getOutgoingEdgeIter () const |
edge * | edgeIterNext (edge_iterator &) const |
edge_iterator | getEdgeIter () const |
edge * | getEdge (unsigned int which) |
neighbor_iterator | getNeighborIter () const |
int | nodeNeighborNext (neighbor_iterator &) const |
edge * | getRandomIncomingEdge () |
edge * | getRandomOutgoingEdge () |
edge * | getRandomEdge () |
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) |
edge * | getMarkedEdge () |
double | getWidth () |
void | setWidth (double val) |
void | Print (std::ostream &) const |
Private Attributes | |
unsigned int | nodeNum |
std::vector< labelValue > | label |
edge * | markedEdge |
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 |
|
|
|
|
|
Implements graph_object. |
|
|
|
|
|
|
|
|
|
|
|
|
|
Reimplemented from graph_object. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Reimplemented from graph_object. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|