Changeset 2084:59769591eb60 in lemon-0.x for lemon/ugraph_adaptor.h
- Timestamp:
- 05/15/06 11:49:51 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2749
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/ugraph_adaptor.h
r2069 r2084 39 39 namespace lemon { 40 40 41 /// \ingroup graph_adaptors42 ///43 41 /// \brief Base type for the Graph Adaptors 44 42 /// … … 234 232 235 233 /// \ingroup graph_adaptors 234 /// 235 /// \brief Trivial undirected graph adaptor 236 /// 237 /// This class is an adaptor which does not change the adapted undirected 238 /// graph. It can be used only to test the undirected graph adaptors. 236 239 template <typename _UGraph> 237 240 class UGraphAdaptor … … 349 352 } 350 353 351 /// \e352 354 /// \brief Hide the given node in the graph. 355 /// 353 356 /// This function hides \c n in the graph, i.e. the iteration 354 357 /// jumps over it. This is done by simply setting the value of \c n … … 356 359 void hide(const Node& n) const { node_filter_map->set(n, false); } 357 360 358 /// \e359 361 /// \brief Hide the given undirected edge in the graph. 362 /// 360 363 /// This function hides \c e in the graph, i.e. the iteration 361 364 /// jumps over it. This is done by simply setting the value of \c e 362 /// to be false in the corresponding edge-map.365 /// to be false in the corresponding uedge-map. 363 366 void hide(const UEdge& e) const { uedge_filter_map->set(e, false); } 364 367 365 /// \e366 368 /// \brief Unhide the given node in the graph. 369 /// 367 370 /// The value of \c n is set to be true in the node-map which stores 368 371 /// hide information. If \c n was hidden previuosly, then it is shown … … 370 373 void unHide(const Node& n) const { node_filter_map->set(n, true); } 371 374 372 /// \e373 374 /// The value of \c e is set to be true in the edge-map which stores375 /// \brief Hide the given undirected edge in the graph. 376 /// 377 /// The value of \c e is set to be true in the uedge-map which stores 375 378 /// hide information. If \c e was hidden previuosly, then it is shown 376 379 /// again 377 380 void unHide(const UEdge& e) const { uedge_filter_map->set(e, true); } 378 381 382 /// \brief Returns true if \c n is hidden. 383 /// 379 384 /// Returns true if \c n is hidden. 380 381 ///\e382 ///383 385 bool hidden(const Node& n) const { return !(*node_filter_map)[n]; } 384 386 385 /// Returns true if \c n is hidden. 386 387 ///\e 388 /// 387 /// \brief Returns true if \c e is hidden. 388 /// 389 /// Returns true if \c e is hidden. 389 390 bool hidden(const UEdge& e) const { return !(*uedge_filter_map)[e]; } 390 391 … … 578 579 } 579 580 580 /// \e581 581 /// \brief Hide the given node in the graph. 582 /// 582 583 /// This function hides \c n in the graph, i.e. the iteration 583 584 /// jumps over it. This is done by simply setting the value of \c n … … 585 586 void hide(const Node& n) const { node_filter_map->set(n, false); } 586 587 587 /// \e588 588 /// \brief Hide the given undirected edge in the graph. 589 /// 589 590 /// This function hides \c e in the graph, i.e. the iteration 590 591 /// jumps over it. This is done by simply setting the value of \c e 591 /// to be false in the corresponding edge-map.592 /// to be false in the corresponding uedge-map. 592 593 void hide(const UEdge& e) const { uedge_filter_map->set(e, false); } 593 594 594 /// \e595 595 /// \brief Unhide the given node in the graph. 596 /// 596 597 /// The value of \c n is set to be true in the node-map which stores 597 598 /// hide information. If \c n was hidden previuosly, then it is shown … … 599 600 void unHide(const Node& n) const { node_filter_map->set(n, true); } 600 601 601 /// \e602 603 /// The value of \c e is set to be true in the edge-map which stores602 /// \brief Hide the given undirected edge in the graph. 603 /// 604 /// The value of \c e is set to be true in the uedge-map which stores 604 605 /// hide information. If \c e was hidden previuosly, then it is shown 605 606 /// again 606 607 void unHide(const UEdge& e) const { uedge_filter_map->set(e, true); } 607 608 609 /// \brief Returns true if \c n is hidden. 610 /// 608 611 /// Returns true if \c n is hidden. 609 610 ///\e611 ///612 612 bool hidden(const Node& n) const { return !(*node_filter_map)[n]; } 613 613 614 /// Returns true if \c n is hidden. 615 616 ///\e 617 /// 614 /// \brief Returns true if \c e is hidden. 615 /// 616 /// Returns true if \c e is hidden. 618 617 bool hidden(const UEdge& e) const { return !(*uedge_filter_map)[e]; } 619 618 … … 734 733 /// node-filter. 735 734 /// 736 /// Note that \c n is of type \c SubGA::NodeIt, but it can be converted to737 /// \c Graph::Node that is why \c g.id(n) can be applied.738 ///739 735 template<typename _UGraph, typename NodeFilterMap, 740 736 typename UEdgeFilterMap, bool checked = true>
Note: See TracChangeset
for help on using the changeset viewer.