COIN-OR::LEMON - Graph Library

Changeset 1270:dceba191c00d in lemon for lemon/core.h


Ignore:
Timestamp:
08/09/13 11:28:17 (9 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Children:
1271:fb1c7da561ce, 1381:e0ccc1f0268f
Phase:
public
Message:

Apply unify-sources.sh to the source tree

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/core.h

    r1261 r1270  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2010
     5 * Copyright (C) 2003-2013
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    255255
    256256  namespace _graph_utils_bits {
    257    
     257
    258258    template <typename Graph, typename Enable = void>
    259259    struct CountRedNodesSelector {
     
    265265    template <typename Graph>
    266266    struct CountRedNodesSelector<
    267       Graph, typename 
    268       enable_if<typename Graph::NodeNumTag, void>::type> 
     267      Graph, typename
     268      enable_if<typename Graph::NodeNumTag, void>::type>
    269269    {
    270270      static int count(const Graph &g) {
    271271        return g.redNum();
    272272      }
    273     };   
     273    };
    274274  }
    275275
     
    280280  /// graph structures it is specialized to run in O(1).
    281281  ///
    282   /// If the graph contains a \e redNum() member function and a 
     282  /// If the graph contains a \e redNum() member function and a
    283283  /// \e NodeNumTag tag then this function calls directly the member
    284284  /// function to query the cardinality of the node set.
     
    289289
    290290  namespace _graph_utils_bits {
    291    
     291
    292292    template <typename Graph, typename Enable = void>
    293293    struct CountBlueNodesSelector {
     
    299299    template <typename Graph>
    300300    struct CountBlueNodesSelector<
    301       Graph, typename 
    302       enable_if<typename Graph::NodeNumTag, void>::type> 
     301      Graph, typename
     302      enable_if<typename Graph::NodeNumTag, void>::type>
    303303    {
    304304      static int count(const Graph &g) {
    305305        return g.blueNum();
    306306      }
    307     };   
     307    };
    308308  }
    309309
     
    314314  /// graph structures it is specialized to run in O(1).
    315315  ///
    316   /// If the graph contains a \e blueNum() member function and a 
     316  /// If the graph contains a \e blueNum() member function and a
    317317  /// \e NodeNumTag tag then this function calls directly the member
    318318  /// function to query the cardinality of the node set.
     
    18661866    /// The Digraph type
    18671867    typedef GR Digraph;
    1868    
     1868
    18691869  protected:
    18701870
Note: See TracChangeset for help on using the changeset viewer.