Changeset 1443:70781827eb2f in lemon0.x for lemon/dfs.h
 Timestamp:
 06/02/05 16:43:45 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1920
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/dfs.h
r1438 r1443 500 500 ///Adds a new source node to the set of nodes to be processed. 501 501 /// 502 ///\bug dist 's are wrong (or at least strange) in case of multiple sources.502 ///\bug dists are wrong (or at least strange) in case of multiple sources. 503 503 void addSource(Node s) 504 504 { … … 517 517 ///Processes the next node. 518 518 /// 519 ///\ warningThe stack must not be empty!519 ///\pre The stack must not be empty! 520 520 void processNextEdge() 521 521 { … … 566 566 ///%DFS path to each node. The algorithm computes 567 567 /// The %DFS tree. 568 /// The distance of each node from the root(s) .568 /// The distance of each node from the root(s) in the %DFS tree. 569 569 /// 570 570 void start() … … 585 585 ///%DFS path to \c dest. The algorithm computes 586 586 /// The %DFS path to \c dest. 587 /// The distance of \c dest from the root(s) .587 /// The distance of \c dest from the root(s) in the %DFS tree. 588 588 /// 589 589 void start(Node dest) … … 602 602 ///\param nm must be a bool (or convertible) edge map. The algorithm 603 603 ///will stop when it reaches an edge \c e with <tt>nm[e]==true</tt>. 604 /// 604 605 ///\warning Contrary to \ref Dfs and \ref Dijkstra, \c nm is an edge map, 605 606 ///not a node map. … … 617 618 ///%DFS path to each node. The algorithm computes 618 619 /// The %DFS tree. 619 /// The distance of each node from the root .620 /// The distance of each node from the root in the %DFS tree. 620 621 /// 621 622 ///\note d.run(s) is just a shortcut of the following code. … … 663 664 ///Copies the path to \c t on the DFS tree into \c p 664 665 665 ///This function copies the path on the DFS tree to \c tinto \c p.666 ///This function copies the path to \c t on the DFS tree into \c p. 666 667 ///If \c t is a source itself or unreachable, then it does not 667 668 ///alter \c p. … … 901 902 }; 902 903 903 /// A class to make the usage of Dfs algorithm easier904 905 /// This class is created to make it easier to use Dfs algorithm.904 /// A class to make the usage of the Dfs algorithm easier 905 906 /// This class is created to make it easier to use the Dfs algorithm. 906 907 /// It uses the functions and features of the plain \ref Dfs, 907 908 /// but it is much simpler to use it. … … 948 949 // ///nodes of the %DFS paths. 949 950 // typedef typename TR::PredNodeMap PredNodeMap; 950 ///The type of the map that stores the dist s of the nodes.951 ///The type of the map that stores the distances of the nodes. 951 952 typedef typename TR::DistMap DistMap; 952 953
Note: See TracChangeset
for help on using the changeset viewer.