#include <lemon/bits/invalid.h>
#include <lemon/bits/utility.h>
#include <lemon/concepts/maps.h>
#include <lemon/concept_check.h>
#include <lemon/concepts/graph_components.h>
Classes | |
class | Graph |
Class describing the concept of Directed Graphs. More... | |
class | Node |
Class for identifying a node of the graph. More... | |
class | NodeIt |
This iterator goes through each node. More... | |
class | Edge |
Class for identifying an edge of the graph. More... | |
class | OutEdgeIt |
This iterator goes trough the outgoing edges of a node. More... | |
class | InEdgeIt |
This iterator goes trough the incoming edges of a node. More... | |
class | EdgeIt |
This iterator goes through each edge. More... | |
class | NodeMap< T > |
Read write map of the nodes to type T . More... | |
class | EdgeMap< T > |
Read write map of the edges to type T . More... | |
Namespaces | |
namespace | lemon |
The namespace of LEMON. | |
namespace | lemon::concepts |
The namespace of LEMON concepts and concept checking classes. |