382 Node aNode(const OutEdgeIt& e) const { return Node(graph->aNode(e.e)); } |
382 Node aNode(const OutEdgeIt& e) const { return Node(graph->aNode(e.e)); } |
383 Node aNode(const InEdgeIt& e) const { return Node(graph->aNode(e.e)); } |
383 Node aNode(const InEdgeIt& e) const { return Node(graph->aNode(e.e)); } |
384 Node bNode(const OutEdgeIt& e) const { return Node(graph->bNode(e.e)); } |
384 Node bNode(const OutEdgeIt& e) const { return Node(graph->bNode(e.e)); } |
385 Node bNode(const InEdgeIt& e) const { return Node(graph->bNode(e.e)); } |
385 Node bNode(const InEdgeIt& e) const { return Node(graph->bNode(e.e)); } |
386 |
386 |
|
387 ///\todo |
|
388 ///Some doki, please. |
387 void hide(const Node& n) const { node_filter_map->set(n, false); } |
389 void hide(const Node& n) const { node_filter_map->set(n, false); } |
|
390 ///\todo |
|
391 ///Some doki, please. |
388 void hide(const Edge& e) const { edge_filter_map->set(e, false); } |
392 void hide(const Edge& e) const { edge_filter_map->set(e, false); } |
389 |
393 |
|
394 ///\todo |
|
395 ///Some doki, please. |
390 void unHide(const Node& n) const { node_filter_map->set(n, true); } |
396 void unHide(const Node& n) const { node_filter_map->set(n, true); } |
|
397 ///\todo |
|
398 ///Some doki, please. |
391 void unHide(const Edge& e) const { edge_filter_map->set(e, true); } |
399 void unHide(const Edge& e) const { edge_filter_map->set(e, true); } |
392 |
400 |
|
401 ///\todo |
|
402 ///Some doki, please. |
393 bool hidden(const Node& n) const { return (*node_filter_map)[n]; } |
403 bool hidden(const Node& n) const { return (*node_filter_map)[n]; } |
|
404 ///\todo |
|
405 ///Some doki, please. |
394 bool hidden(const Edge& e) const { return (*edge_filter_map)[e]; } |
406 bool hidden(const Edge& e) const { return (*edge_filter_map)[e]; } |
395 }; |
407 }; |
396 |
408 |
397 /// A wrapper for forgetting the orientation of a graph. |
409 /// A wrapper for forgetting the orientation of a graph. |
398 |
410 |