Changeset 561:a10e6f1769e2 in lemon0.x
 Timestamp:
 05/06/04 21:01:00 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@734
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

doc/Doxyfile
r542 r561 400 400 ../src/work/athos/minlengthpaths.h \ 401 401 ../src/work/klao/path.h \ 402 ../src/work/marci/graph_wrapper.h \403 402 ../src/work/jacint/max_flow.h 404 403 
src/hugo/graph_wrapper.h
r560 r561 437 437 return Node(this>graph>bNode(e.e)); } 438 438 439 ///\todo 440 ///Some doki, please. 439 /// This function hides \c n in the graph, i.e. the iteration 440 /// jumps over it. This is done by simply setting the value of \c n 441 /// to be false in the corresponding nodemap. 441 442 void hide(const Node& n) const { node_filter_map>set(n, false); } 442 ///\todo 443 ///Some doki, please. 443 444 /// This function hides \c e in the graph, i.e. the iteration 445 /// jumps over it. This is done by simply setting the value of \c e 446 /// to be false in the corresponding edgemap. 444 447 void hide(const Edge& e) const { edge_filter_map>set(e, false); } 445 448 446 ///\todo 447 ///Some doki, please. 448 void unHide(const Node& n) const { node_filter_map>set(n, true); } 449 ///\todo 450 ///Some doki, please. 449 /// The value of \c n is set to be true in the nodemap which stores 450 /// hide information. If \c n was hidden previuosly, then it is shown 451 /// again 452 void unHide(const Node& n) const { node_filter_map>set(n, true); } 453 454 /// The value of \c e is set to be true in the edgemap which stores 455 /// hide information. If \c e was hidden previuosly, then it is shown 456 /// again 451 457 void unHide(const Edge& e) const { edge_filter_map>set(e, true); } 452 458 453 ///\todo 454 ///Some doki, please. 455 bool hidden(const Node& n) const { return (*node_filter_map)[n]; } 456 ///\todo 457 ///Some doki, please. 458 bool hidden(const Edge& e) const { return (*edge_filter_map)[e]; } 459 /// Returns true if \c n is hidden. 460 bool hidden(const Node& n) const { return !(*node_filter_map)[n]; } 461 462 /// Returns true if \c n is hidden. 463 bool hidden(const Edge& e) const { return !(*edge_filter_map)[e]; } 459 464 }; 460 465
Note: See TracChangeset
for help on using the changeset viewer.