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