#include <lemon/concepts/graph_components.h>#include <lemon/core.h>Classes | |
| class | Graph |
| Class describing the concept of Undirected Graphs. More... | |
| class | Graph::Node |
| The base type of node iterators, or in other words, the trivial node iterator. More... | |
| class | Graph::NodeIt |
| This iterator goes through each node. More... | |
| class | Graph::Edge |
| class | Graph::EdgeIt |
| This iterator goes through each edge. More... | |
| class | Graph::IncEdgeIt |
| This iterator goes trough the incident undirected arcs of a node. More... | |
| class | Graph::Arc |
| The directed arc type. More... | |
| class | Graph::ArcIt |
| This iterator goes through each directed arc. More... | |
| class | Graph::OutArcIt |
| This iterator goes trough the outgoing directed arcs of a node. More... | |
| class | Graph::InArcIt |
| This iterator goes trough the incoming directed arcs of a node. More... | |
| class | Graph::NodeMap< T > |
| class | Graph::ArcMap< T > |
| class | Graph::EdgeMap< T > |
Namespaces | |
| namespace | lemon |
The namespace of LEMON. | |
| namespace | lemon::concepts |
The namespace of LEMON concepts and concept checking classes. | |
1.7.3