COIN-OR::LEMON - Graph Library

Changeset 1570:da93692e6537 in lemon-0.x


Ignore:
Timestamp:
07/20/05 10:01:16 (14 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2069
Message:

docfix

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/kruskal.h

    r1557 r1570  
    9393  /// people would expect. So, one should be careful not to add both of the
    9494  /// <tt>Edge</tt>s belonging to a certain <tt>UndirEdge</tt>.
    95   /// (\ref kruskalEdgeMap() and \ref KruskalMapInput are kind enough to do so.)
     95  /// (\ref kruskal() and \ref KruskalMapInput are kind enough to do so.)
    9696
    9797#ifdef DOXYGEN
     
    188188  /// Kruskal's input source.
    189189  ///
    190   /// In most cases you possibly want to use the \ref kruskalEdgeMap() instead.
     190  /// In most cases you possibly want to use the \ref kruskal() instead.
    191191  ///
    192192  /// \sa makeKruskalMapInput()
     
    255255  ///
    256256  /// In most cases you possibly
    257   /// want to use the function kruskalEdgeMap() instead.
     257  /// want to use \ref kruskal() instead.
    258258  ///
    259259  ///\param g The type of the graph the algorithm runs on.
     
    392392//   \code
    393393//   std::vector<Edge> tree(53);
    394 //   kruskalEdgeMap_IteratorOut(g,cost,tree.begin());
     394//   kruskal(g,cost,tree.begin());
    395395//   \endcode
    396396//   Or if we don't know in advance the size of the tree, we can write this.
    397397//   \code
    398398//   std::vector<Edge> tree;
    399 //   kruskalEdgeMap_IteratorOut(g,cost,std::back_inserter(tree));
     399//   kruskal(g,cost,std::back_inserter(tree));
    400400//   \endcode
    401401// 
Note: See TracChangeset for help on using the changeset viewer.