The node class. More...
#include <MultiGraph.h>
Public Member Functions | |
| Node (const std::string &id, const _NodeInfo info) | |
| Constructor. | |
| ~Node () | |
| bool | del_edge (Edge *edge) |
| const std::string & | id () const |
| const _NodeInfo & | info () const |
| _NodeInfo & | mutable_info () |
| const EdgeVector & | out_edges () const |
| const EdgeVector & | in_edges () const |
| EdgeVector & | out_edges () |
| EdgeVector & | in_edges () |
Private Attributes | |
| std::string | id_ |
| _NodeInfo | info_ |
| EdgeVector | out_edges_ |
| EdgeVector | in_edges_ |
Friends | |
| class | MultiGraph |
|
| |
| u_int32_t | distance_ |
| Dijkstra algorithm state. | |
| enum dtn::MultiGraph::Node::{ WHITE, GRAY, BLACK } | color_ |
| Dijkstra algorithm state. | |
| Edge * | prev_ |
| Dijkstra algorithm state. | |
The node class.
Definition at line 119 of file MultiGraph.h.
anonymous enum [private] |
| dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::Node | ( | const std::string & | id, | |
| const _NodeInfo | info | |||
| ) | [inline] |
Constructor.
Definition at line 122 of file MultiGraph.h.
| dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::~Node | ( | ) |
| bool dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::del_edge | ( | Edge * | edge | ) |
| const std::string& dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::id | ( | ) | const [inline] |
Definition at line 129 of file MultiGraph.h.
References dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::id_.
| EdgeVector& dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::in_edges | ( | ) | [inline] |
Definition at line 138 of file MultiGraph.h.
References dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::in_edges_.
| const EdgeVector& dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::in_edges | ( | ) | const [inline] |
Definition at line 135 of file MultiGraph.h.
References dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::in_edges_.
| const _NodeInfo& dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::info | ( | ) | const [inline] |
Definition at line 131 of file MultiGraph.h.
References dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::info_.
| _NodeInfo& dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::mutable_info | ( | ) | [inline] |
Definition at line 132 of file MultiGraph.h.
References dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::info_.
| EdgeVector& dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::out_edges | ( | ) | [inline] |
Definition at line 137 of file MultiGraph.h.
References dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::out_edges_.
| const EdgeVector& dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::out_edges | ( | ) | const [inline] |
Definition at line 134 of file MultiGraph.h.
References dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::out_edges_.
friend class MultiGraph [friend] |
Definition at line 141 of file MultiGraph.h.
enum { ... } dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::color_ [private] |
Dijkstra algorithm state.
u_int32_t dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::distance_ [mutable, private] |
Dijkstra algorithm state.
Definition at line 153 of file MultiGraph.h.
std::string dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::id_ [private] |
Definition at line 143 of file MultiGraph.h.
Referenced by dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::id().
EdgeVector dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::in_edges_ [private] |
Definition at line 147 of file MultiGraph.h.
Referenced by dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::in_edges().
_NodeInfo dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::info_ [private] |
Definition at line 144 of file MultiGraph.h.
Referenced by dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::info(), and dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::mutable_info().
EdgeVector dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::out_edges_ [private] |
Definition at line 146 of file MultiGraph.h.
Referenced by dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::out_edges().
Edge* dtn::MultiGraph< _NodeInfo, _EdgeInfo >::Node::prev_ [mutable, private] |
Dijkstra algorithm state.
Definition at line 159 of file MultiGraph.h.
1.6.3