#include <lemon/concept/graph_component.h>
#include <lemon/concept/graph.h>
#include <lemon/utility.h>
Go to the source code of this file.
Namespaces | |
namespace | lemon |
namespace | lemon::concept |
Classes | |
class | UndirGraph |
Class describing the concept of Undirected Graphs. More... | |
class | UndirGraph::Node |
class | UndirGraph::NodeIt |
This iterator goes through each node. More... | |
class | UndirGraph::UndirEdge |
The base type of the undirected edge iterators. More... | |
class | UndirGraph::UndirEdgeIt |
This iterator goes through each undirected edge. More... | |
class | UndirGraph::IncEdgeIt |
This iterator goes trough the incident undirected edges of a node. More... | |
class | UndirGraph::Edge |
The directed edge type. More... | |
class | UndirGraph::EdgeIt |
This iterator goes through each directed edge. More... | |
class | UndirGraph::OutEdgeIt |
This iterator goes trough the outgoing directed edges of a node. More... | |
class | UndirGraph::InEdgeIt |
This iterator goes trough the incoming directed edges of a node. More... | |
class | UndirGraph::NodeMap |
Read write map of the nodes to type T . More... | |
class | UndirGraph::EdgeMap |
Read write map of the directed edges to type T . More... | |
class | UndirGraph::UndirEdgeMap |
Read write map of the undirected edges to type T . More... | |
class | ExtendableUndirGraph |
An empty non-static undirected graph class. More... | |
class | ErasableUndirGraph |
An empty erasable undirected graph class. More... |