COIN-OR::LEMON - Graph Library

Changeset 956:141f9c0db4a3 in lemon for lemon/howard_mmc.h


Ignore:
Timestamp:
03/06/10 15:35:12 (10 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Children:
957:f802439d2b58, 959:38213abd2911, 1041:f112c18bc304
Phase:
public
Message:

Unify the sources (#339)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/howard_mmc.h

    r942 r956  
    1 /* -*- C++ -*-
     1/* -*- mode: C++; indent-tabs-mode: nil; -*-
    22 *
    3  * This file is a part of LEMON, a generic C++ optimization library
     3 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    122122  {
    123123  public:
    124  
     124
    125125    /// The type of the digraph
    126126    typedef typename TR::Digraph Digraph;
     
    153153
    154154    TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);
    155  
     155
    156156    // The digraph the algorithm runs on
    157157    const Digraph &_gr;
     
    180180    std::vector<Node>* _nodes;
    181181    typename Digraph::template NodeMap<std::vector<Arc> > _in_arcs;
    182    
     182
    183183    // Queue used for BFS search
    184184    std::vector<Node> _queue;
     
    186186
    187187    Tolerance _tolerance;
    188  
     188
    189189    // Infinite constant
    190190    const LargeCost INF;
    191191
    192192  public:
    193  
     193
    194194    /// \name Named Template Parameters
    195195    /// @{
     
    229229      typedef HowardMmc<GR, CM, SetPathTraits<T> > Create;
    230230    };
    231    
     231
    232232    /// @}
    233233
     
    335335      init();
    336336      findComponents();
    337      
     337
    338338      // Find the minimum cycle mean in the components
    339339      for (int comp = 0; comp < _comp_num; ++comp) {
     
    446446      _cycle_path->clear();
    447447    }
    448    
     448
    449449    // Find strongly connected components and initialize _comp_nodes
    450450    // and _in_arcs
Note: See TracChangeset for help on using the changeset viewer.