COIN-OR::LEMON - Graph Library

Changeset 1909:2d806130e700 in lemon-0.x for lemon/kruskal.h


Ignore:
Timestamp:
01/26/06 16:42:13 (14 years ago)
Author:
Mihaly Barasz
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2484
Message:

Undir -> U transition

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/kruskal.h

    r1875 r1909  
    5252  /// \param g The graph the algorithm runs on.
    5353  /// It can be either \ref concept::StaticGraph "directed" or
    54   /// \ref concept::UndirGraph "undirected".
     54  /// \ref concept::UGraph "undirected".
    5555  /// If the graph is directed, the algorithm consider it to be
    5656  /// undirected by disregarding the direction of the edges.
     
    9090  ///
    9191  /// \warning If kruskal is run on an
    92   /// \ref lemon::concept::UndirGraph "undirected graph", be sure that the
     92  /// \ref lemon::concept::UGraph "undirected graph", be sure that the
    9393  /// map storing the tree is also undirected
    94   /// (e.g. UndirListGraph::UndirEdgeMap<bool>, otherwise the values of the
     94  /// (e.g. ListUGraph::UEdgeMap<bool>, otherwise the values of the
    9595  /// half of the edges will not be set.
    9696  ///
    9797  /// \todo Discuss the case of undirected graphs: In this case the algorithm
    98   /// also require <tt>Edge</tt>s instead of <tt>UndirEdge</tt>s, as some
     98  /// also require <tt>Edge</tt>s instead of <tt>UEdge</tt>s, as some
    9999  /// people would expect. So, one should be careful not to add both of the
    100   /// <tt>Edge</tt>s belonging to a certain <tt>UndirEdge</tt>.
     100  /// <tt>Edge</tt>s belonging to a certain <tt>UEdge</tt>.
    101101  /// (\ref kruskal() and \ref KruskalMapInput are kind enough to do so.)
    102102
     
    226226
    227227    template<class _GR>
    228     typename enable_if<typename _GR::UndirTag,void>::type
     228    typename enable_if<typename _GR::UTag,void>::type
    229229    fillWithEdges(const _GR& g, const Map& m,dummy<0> = 0)
    230230    {
    231       for(typename GR::UndirEdgeIt e(g);e!=INVALID;++e)
     231      for(typename GR::UEdgeIt e(g);e!=INVALID;++e)
    232232        push_back(value_type(g.direct(e, true), m[e]));
    233233    }
    234234
    235235    template<class _GR>
    236     typename disable_if<typename _GR::UndirTag,void>::type
     236    typename disable_if<typename _GR::UTag,void>::type
    237237    fillWithEdges(const _GR& g, const Map& m,dummy<1> = 1)
    238238    {
Note: See TracChangeset for help on using the changeset viewer.