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