Changeset 2354:3609c77b77be in lemon0.x for lemon
 Timestamp:
 02/06/07 20:09:17 (13 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3154
 Location:
 lemon
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

lemon/dijkstra.h
r2335 r2354 511 511 512 512 public: 513 514 typedef PredMapPath<Graph, PredMap> Path; 515 513 516 ///\name Execution control 514 517 ///The simplest way to execute the algorithm is to use … … 720 723 ///@{ 721 724 722 typedef PredMapPath<Graph, PredMap> Path;723 724 725 ///Gives back the shortest path. 725 726 
lemon/kruskal.h
r2308 r2354 32 32 ///Kruskal's algorithm to compute a minimum cost tree. 33 33 /// 34 ///\todo The file still needs some cleanup.35 34 36 35 namespace lemon { … … 89 88 /// half of the edges will not be set. 90 89 /// 91 /// \todo Discuss the case of undirected graphs: In this case the algorithm92 /// also require <tt>Edge</tt>s instead of <tt>UEdge</tt>s, as some93 /// people would expect. So, one should be careful not to add both of the94 /// <tt>Edge</tt>s belonging to a certain <tt>UEdge</tt>.95 /// (\ref kruskal() and \ref KruskalMapInput are kind enough to do so.)96 90 97 91 #ifdef DOXYGEN 98 92 template <class GR, class IN, class OUT> 99 typename IN::value_type::second_type93 CostType 100 94 kruskal(GR const& g, IN const& in, 101 95 OUT& out)
Note: See TracChangeset
for help on using the changeset viewer.