Changeset 286:da414906fe21 in lemon for lemon/bfs.h
 Timestamp:
 09/26/08 12:40:11 (14 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/bfs.h
r278 r286 608 608 /// 609 609 ///This method runs the %BFS algorithm from the root node(s) 610 ///in order to compute the shortest path to \c dest.610 ///in order to compute the shortest path to \c t. 611 611 /// 612 612 ///The algorithm computes 613 /// the shortest path to \c dest,614 /// the distance of \c dest from the root(s).613 /// the shortest path to \c t, 614 /// the distance of \c t from the root(s). 615 615 /// 616 616 ///\pre init() must be called and at least one root node should be … … 624 624 /// } 625 625 ///\endcode 626 void start(Node dest)626 void start(Node t) 627 627 { 628 628 bool reach = false; 629 while ( !emptyQueue() && !reach ) processNextNode( dest, reach);629 while ( !emptyQueue() && !reach ) processNextNode(t, reach); 630 630 } 631 631 … … 665 665 } 666 666 667 ///Runs the algorithm from the given node.667 ///Runs the algorithm from the given source node. 668 668 669 669 ///This method runs the %BFS algorithm from node \c s … … 689 689 690 690 ///This method runs the %BFS algorithm from node \c s 691 ///in order to compute the shortest path to \c t.692 /// 693 /// \return The length of the shortest <tt>s</tt><tt>t</tt> path,694 /// if \c t is reachable form \c s, \c 0 otherwise.691 ///in order to compute the shortest path to node \c t 692 ///(it stops searching when \c t is processed). 693 /// 694 ///\return \c true if \c t is reachable form \c s. 695 695 /// 696 696 ///\note Apart from the return value, <tt>b.run(s,t)</tt> is just a … … 701 701 /// b.start(t); 702 702 ///\endcode 703 intrun(Node s,Node t) {703 bool run(Node s,Node t) { 704 704 init(); 705 705 addSource(s); 706 706 start(t); 707 return reached(t) ? _curr_dist : 0;707 return reached(t); 708 708 } 709 709 … … 1622 1622 /// 1623 1623 /// This method runs the %BFS algorithm from the root node(s) 1624 /// in order to compute the shortest path to \c dest.1624 /// in order to compute the shortest path to \c t. 1625 1625 /// 1626 1626 /// The algorithm computes 1627 ///  the shortest path to \c dest,1628 ///  the distance of \c dest from the root(s).1627 ///  the shortest path to \c t, 1628 ///  the distance of \c t from the root(s). 1629 1629 /// 1630 1630 /// \pre init() must be called and at least one root node should be … … 1638 1638 /// } 1639 1639 /// \endcode 1640 void start(Node dest) {1640 void start(Node t) { 1641 1641 bool reach = false; 1642 while ( !emptyQueue() && !reach ) processNextNode( dest, reach);1642 while ( !emptyQueue() && !reach ) processNextNode(t, reach); 1643 1643 } 1644 1644 … … 1678 1678 } 1679 1679 1680 /// \brief Runs the algorithm from the given node.1680 /// \brief Runs the algorithm from the given source node. 1681 1681 /// 1682 1682 /// This method runs the %BFS algorithm from node \c s … … 1697 1697 addSource(s); 1698 1698 start(); 1699 } 1700 1701 /// \brief Finds the shortest path between \c s and \c t. 1702 /// 1703 /// This method runs the %BFS algorithm from node \c s 1704 /// in order to compute the shortest path to node \c t 1705 /// (it stops searching when \c t is processed). 1706 /// 1707 /// \return \c true if \c t is reachable form \c s. 1708 /// 1709 /// \note Apart from the return value, <tt>b.run(s,t)</tt> is just a 1710 /// shortcut of the following code. 1711 ///\code 1712 /// b.init(); 1713 /// b.addSource(s); 1714 /// b.start(t); 1715 ///\endcode 1716 bool run(Node s,Node t) { 1717 init(); 1718 addSource(s); 1719 start(t); 1720 return reached(t); 1699 1721 } 1700 1722
Note: See TracChangeset
for help on using the changeset viewer.