#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>
Namespaces | |
namespace | lemon |
namespace | lemon::concepts |
Classes | |
class | Graph |
The directed graph concept. More... | |
class | Graph::Node |
Class for identifying a node of the graph. More... | |
class | Graph::NodeIt |
This iterator goes through each node. More... | |
class | Graph::Edge |
Class for identifying an edge of the graph. More... | |
class | Graph::OutEdgeIt |
This iterator goes trough the outgoing edges of a node. More... | |
class | Graph::InEdgeIt |
This iterator goes trough the incoming edges of a node. More... | |
class | Graph::EdgeIt |
This iterator goes through each edge. More... | |
class | Graph::NodeMap |
Read write map of the nodes to type T . More... | |
class | Graph::EdgeMap |
Read write map of the edges to type T . More... |