COIN-OR::LEMON - Graph Library

Changeset 2354:3609c77b77be in lemon-0.x


Ignore:
Timestamp:
02/06/07 20:09:17 (12 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3154
Message:

Doc improvements

Location:
lemon
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • lemon/dijkstra.h

    r2335 r2354  
    511511
    512512  public:
     513
     514    typedef PredMapPath<Graph, PredMap> Path;
     515
    513516    ///\name Execution control
    514517    ///The simplest way to execute the algorithm is to use
     
    720723    ///@{
    721724
    722     typedef PredMapPath<Graph, PredMap> Path;
    723 
    724725    ///Gives back the shortest path.
    725726   
  • lemon/kruskal.h

    r2308 r2354  
    3232///Kruskal's algorithm to compute a minimum cost tree.
    3333///
    34 ///\todo The file still needs some clean-up.
    3534
    3635namespace lemon {
     
    8988  /// half of the edges will not be set.
    9089  ///
    91   /// \todo Discuss the case of undirected graphs: In this case the algorithm
    92   /// also require <tt>Edge</tt>s instead of <tt>UEdge</tt>s, as some
    93   /// people would expect. So, one should be careful not to add both of the
    94   /// <tt>Edge</tt>s belonging to a certain <tt>UEdge</tt>.
    95   /// (\ref kruskal() and \ref KruskalMapInput are kind enough to do so.)
    9690
    9791#ifdef DOXYGEN
    9892  template <class GR, class IN, class OUT>
    99   typename IN::value_type::second_type
     93  CostType
    10094  kruskal(GR const& g, IN const& in,
    10195          OUT& out)
Note: See TracChangeset for help on using the changeset viewer.