# Changeset 1981:81c8efe92706 in lemon-0.x

Ignore:
Timestamp:
02/23/06 10:03:18 (18 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2574
Message:

Little bugfixes, spellchecks and improvements

Location:
lemon
Files:
4 edited

Unmodified
Removed
• ## lemon/bits/graph_extender.h

 r1979 /// If the given bool is true the given undirected edge and the /// returned edge have the same source node. Edge direct(const UEdge &ue, bool d) const { static Edge direct(const UEdge &ue, bool d) { return Edge(ue, d); } /// \todo reference to the corresponding point of the undirected graph /// concept. "What does the direction of an undirected edge mean?" bool direction(const Edge &e) const { return e.forward; } static bool direction(const Edge &e) { return e.forward; }
• ## lemon/dfs.h

 r1956 } ///Runs %DFS algorithm to visit all nodes in the graph. ///This method runs the %DFS algorithm in order to ///compute the ///%DFS path to each node. The algorithm computes ///- The %DFS tree. ///- The distance of each node from the root in the %DFS tree. /// ///\note d.run() is just a shortcut of the following code. ///\code ///  d.init(); ///  for (NodeIt it(graph); it != INVALID; ++it) { ///    if (!d.reached(it)) { ///      d.addSource(it); ///      d.start(); ///    } ///  } ///\endcode void run() { init(); for (NodeIt it(*G); it != INVALID; ++it) { if (!reached(it)) { addSource(it); start(); } } } ///Runs %DFS algorithm from node \c s. ///Returns the distance of a node from the root(s). ///\pre \ref run() must be called before using this function. ///\warning If node \c v is unreachable from the root(s) then the return value ///of this funcion is undefined. ///\warning If node \c v is unreachable from the root(s) then the return ///value of this funcion is undefined. int dist(Node v) const { return (*_dist)[v]; } } /// \brief Runs %DFS algorithm from node \c s. /// \brief Runs %DFSVisit algorithm from node \c s. /// /// This method runs the %DFS algorithm from a root node \c s. start(); } /// \brief Runs %DFSVisit algorithm to visit all nodes in the graph. /// This method runs the %DFS algorithm in order to /// compute the %DFS path to each node. The algorithm computes /// - The %DFS tree. /// - The distance of each node from the root in the %DFS tree. /// ///\note d.run() is just a shortcut of the following code. ///\code ///  d.init(); ///  for (NodeIt it(graph); it != INVALID; ++it) { ///    if (!d.reached(it)) { ///      d.addSource(it); ///      d.start(); ///    } ///  } ///\endcode void run() { init(); for (NodeIt it(*_graph); it != INVALID; ++it) { if (!reached(it)) { addSource(it); start(); } } } ///@}
• ## lemon/dijkstra.h

 r1956 ///If you don't use this function before calling \ref run(), ///it will allocate one. The destuctor deallocates this ///automatically allocated map, of course. ///automatically allocated heap and cross reference, of course. ///\return (*this) Dijkstra &heap(Heap& heap, HeapCrossRef &crossRef)
• ## lemon/graph_utils.h

 r1956 } void run() {} void run() const {} private: } void run() {} void run() const {} private:
Note: See TracChangeset for help on using the changeset viewer.