#include <lemon/concepts/graph_components.h>#include <lemon/concepts/maps.h>#include <lemon/concept_check.h>#include <lemon/core.h>| Classes | |
| class | BpGraph | 
| Class describing the concept of undirected bipartite graphs.  More... | |
| class | BpGraph::Node | 
| The node type of the graph.  More... | |
| class | BpGraph::RedNode | 
| Class to represent red nodes.  More... | |
| class | BpGraph::BlueNode | 
| Class to represent blue nodes.  More... | |
| class | BpGraph::RedNodeIt | 
| Iterator class for the red nodes.  More... | |
| class | BpGraph::BlueNodeIt | 
| Iterator class for the blue nodes.  More... | |
| class | BpGraph::NodeIt | 
| Iterator class for the nodes.  More... | |
| class | BpGraph::Edge | 
| The edge type of the graph.  More... | |
| class | BpGraph::EdgeIt | 
| Iterator class for the edges.  More... | |
| class | BpGraph::IncEdgeIt | 
| Iterator class for the incident edges of a node.  More... | |
| class | BpGraph::Arc | 
| The arc type of the graph.  More... | |
| class | BpGraph::ArcIt | 
| Iterator class for the arcs.  More... | |
| class | BpGraph::OutArcIt | 
| Iterator class for the outgoing arcs of a node.  More... | |
| class | BpGraph::InArcIt | 
| Iterator class for the incoming arcs of a node.  More... | |
| class | BpGraph::NodeMap< T > | 
| Standard graph map type for the nodes.  More... | |
| class | BpGraph::RedNodeMap< T > | 
| Standard graph map type for the red nodes.  More... | |
| class | BpGraph::BlueNodeMap< T > | 
| Standard graph map type for the blue nodes.  More... | |
| class | BpGraph::ArcMap< T > | 
| Standard graph map type for the arcs.  More... | |
| class | BpGraph::EdgeMap< T > | 
| Standard graph map type for the edges.  More... | |
| Namespaces | |
| lemon | |
| The namespace of LEMON. | |
| lemon::concepts | |
| The namespace of LEMON concepts and concept checking classes. | |
 1.8.5
 1.8.5