|
| | FilterEdges (GR &graph, EF &edge_filter) |
| | Constructor.
|
| | FilterEdges (const FilterEdges &other) |
| | Copy constructor.
|
| FilterEdges & | operator= (const FilterEdges &other) |
| | Assignment.
|
| void | status (const Edge &e, bool v) const |
| | Sets the status of the given edge.
|
| bool | status (const Edge &e) const |
| | Returns the status of the given edge.
|
| void | disable (const Edge &e) const |
| | Disables the given edge.
|
| void | enable (const Edge &e) const |
| | Enables the given edge.
|
template< typename GR , typename EF >
class lemon::FilterEdges< GR , EF >
FilterEdges adaptor can be used for hiding edges in a graph. A bool edge map must be specified, which defines the filter for the edges. Only the edges with true filter value are shown in the subgraph. This adaptor conforms to the Graph concept.
The adapted graph can also be modified through this adaptor by adding or removing nodes or edges, unless the GR template parameter is set to be const.
This class provides only linear time counting for nodes, edges and arcs.
- Template Parameters
-
| GR | The type of the adapted graph. It must conform to the Graph concept. It can also be specified to be const. |
| EF | The type of the edge filter map. It must be a bool (or convertible) edge map of the adapted graph. The default type is GR::EdgeMap< bool >. |
- Note
- The
Node, Edge and Arc types of this adaptor and the adapted graph are convertible to each other.