#include <lemon/concepts/graph_components.h>
#include <lemon/concepts/graph.h>
#include <lemon/concepts/ugraph.h>
#include <lemon/bits/utility.h>
Namespaces | |
namespace | lemon |
namespace | lemon::concepts |
Classes | |
class | BpUGraph |
Class describing the concept of Bipartite Undirected Graphs. More... | |
class | BpUGraph::Node |
The base type of node iterators, or in other words, the trivial node iterator. More... | |
class | BpUGraph::ANode |
Helper class for ANodes. More... | |
class | BpUGraph::BNode |
Helper class for BNodes. More... | |
class | BpUGraph::NodeIt |
This iterator goes through each node. More... | |
class | BpUGraph::ANodeIt |
This iterator goes through each ANode. More... | |
class | BpUGraph::BNodeIt |
This iterator goes through each BNode. More... | |
class | BpUGraph::UEdge |
The base type of the undirected edge iterators. More... | |
class | BpUGraph::UEdgeIt |
This iterator goes through each undirected edge. More... | |
class | BpUGraph::IncEdgeIt |
This iterator goes trough the incident undirected edges of a node. More... | |
class | BpUGraph::Edge |
The directed edge type. More... | |
class | BpUGraph::EdgeIt |
This iterator goes through each directed edge. More... | |
class | BpUGraph::OutEdgeIt |
This iterator goes trough the outgoing directed edges of a node. More... | |
class | BpUGraph::InEdgeIt |
This iterator goes trough the incoming directed edges of a node. More... | |
class | BpUGraph::NodeMap |
Read write map of the nodes to type T . More... | |
class | BpUGraph::ANodeMap |
Read write map of the ANodes to type T . More... | |
class | BpUGraph::BNodeMap |
Read write map of the BNodes to type T . More... | |
class | BpUGraph::EdgeMap |
Read write map of the directed edges to type T . More... | |
class | BpUGraph::UEdgeMap |
Read write map of the undirected edges to type T . More... |