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