#include <string>
#include <ext/hash_map>
#include <sstream>
#include <ostream>
#include "net/ipaddress.hh"
#include "utl/iterator.hh"
#include "utl/set.hh"
#include "graph.hxx"
Go to the source code of this file.
Namespaces | |
namespace | olsr |
namespace | olsr::gra |
namespace | olsr::gra::internal |
Classes | |
class | olsr::gra::AdjInfo |
An arc of the graph. More... | |
class | olsr::gra::hash_AdjInfo |
Hashing functor for AdjInfo. More... | |
class | olsr::gra::AdjNode |
A Node of the graph. More... | |
class | olsr::gra::hash_AdjNode |
Hashing functor for AdjNode. More... | |
class | olsr::gra::AdjGraph |
The graph per se. More... | |
Defines | |
#define | QOLYESTER_DAEMON_GRA_GRAPH_HH 1 |
Typedefs | |
typedef std::hash_set< AdjInfo, hash_AdjInfo > | olsr::gra::internal::iset_t |
typedef iset_t::const_iterator | olsr::gra::internal::iset_const_iterator |
typedef utl::DeconstIterator< iset_const_iterator > | olsr::gra::internal::iset_iterator |
typedef std::hash_set< AdjNode, hash_AdjNode > | olsr::gra::internal::nset_t |
typedef nset_t::const_iterator | olsr::gra::internal::nset_const_iterator |
typedef utl::DeconstIterator< nset_const_iterator > | olsr::gra::internal::nset_iterator |
typedef utl::Set< AdjInfo, internal::iset_t, internal::iset_iterator > | olsr::gra::arcset_t |
Set of arcs implemented as a hash set. | |
typedef utl::Set< AdjNode, internal::nset_t, internal::nset_iterator > | olsr::gra::nodeset_t |
Set of nodes implemented as a hash set. | |
typedef gra::AdjGraph | olsr::pathnet_t |
Enumerations | |
enum | olsr::gra::AdjTag { olsr::gra::topo = 0, olsr::gra::twohop = 1 } |
Functions | |
std::ostream & | olsr::gra::operator<< (std::ostream &o, const AdjGraph &g) |
#define QOLYESTER_DAEMON_GRA_GRAPH_HH 1 |