#include <lemon/concepts/graph_components.h>
#include <lemon/concepts/graph.h>
#include <lemon/bits/utility.h>
Namespaces | |
namespace | lemon |
namespace | lemon::concepts |
Classes | |
class | UGraph |
Class describing the concept of Undirected Graphs. More... | |
class | UGraph::Node |
The base type of node iterators, or in other words, the trivial node iterator. More... | |
class | UGraph::NodeIt |
This iterator goes through each node. More... | |
class | UGraph::UEdge |
The base type of the undirected edge iterators. More... | |
class | UGraph::UEdgeIt |
This iterator goes through each undirected edge. More... | |
class | UGraph::IncEdgeIt |
This iterator goes trough the incident undirected edges of a node. More... | |
class | UGraph::Edge |
The directed edge type. More... | |
class | UGraph::EdgeIt |
This iterator goes through each directed edge. More... | |
class | UGraph::OutEdgeIt |
This iterator goes trough the outgoing directed edges of a node. More... | |
class | UGraph::InEdgeIt |
This iterator goes trough the incoming directed edges of a node. More... | |
class | UGraph::NodeMap |
Read write map of the nodes to type T . More... | |
class | UGraph::EdgeMap |
Read write map of the directed edges to type T . More... | |
class | UGraph::UEdgeMap |
Read write map of the undirected edges to type T . More... |