This file contains several useful adaptors for digraphs and graphs.
#include <lemon/core.h>#include <lemon/maps.h>#include <lemon/bits/variant.h>#include <lemon/bits/graph_adaptor_extender.h>#include <lemon/bits/map_extender.h>#include <lemon/tolerance.h>#include <algorithm>Classes | |
| class | ReverseDigraph< DGR > |
| Adaptor class for reversing the orientation of the arcs in a digraph. More... | |
| class | SubDigraph< DGR, NF, AF > |
| Adaptor class for hiding nodes and arcs in a digraph. More... | |
| class | SubGraph< GR, NF, EF > |
| Adaptor class for hiding nodes and edges in an undirected graph. More... | |
| class | FilterNodes< GR, NF > |
| Adaptor class for hiding nodes in a digraph or a graph. More... | |
| class | FilterArcs< DGR, AF > |
| Adaptor class for hiding arcs in a digraph. More... | |
| class | FilterEdges< GR, EF > |
| Adaptor class for hiding edges in a graph. More... | |
| class | Undirector< DGR > |
| Adaptor class for viewing a digraph as an undirected graph. More... | |
| class | Undirector< DGR >::CombinedArcMap< FW, BK > |
| Arc map combined from two original arc maps. More... | |
| class | Orienter< GR, DM > |
| Adaptor class for orienting the edges of a graph to get a digraph. More... | |
| class | ResidualDigraph< DGR, CM, FM, TL > |
| Adaptor class for composing the residual digraph for directed flow and circulation problems. More... | |
| class | ResidualDigraph< DGR, CM, FM, TL >::ResidualCapacity |
| Residual capacity map. More... | |
| class | SplitNodes< DGR > |
| Adaptor class for splitting the nodes of a digraph. More... | |
| class | SplitNodes< DGR >::CombinedNodeMap< IN, OUT > |
| Node map combined from two original node maps. More... | |
| class | SplitNodes< DGR >::CombinedArcMap< AM, NM > |
| Arc map combined from an arc map and a node map of the original digraph. More... | |
Namespaces | |
| namespace | lemon |
The namespace of LEMON. | |
1.7.3