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

Timestamp:

03/06/10 15:35:12 (15 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Children:

957:f802439d2b58, 959:38213abd2911, 1041:f112c18bc304

Phase:

public

Message:

Unify the sources (#339)

File:

• lemon/howard_mmc.h (modified) (8 diffs)

lemon/howard_mmc.h

@@ -1 @@
-/* -*- C++ -*-
+/* -*- mode: C++; indent-tabs-mode: nil; -*-
  *
- * This file is a part of LEMON, a generic C++ optimization library
+ * This file is a part of LEMON, a generic C++ optimization library.
  *
- * Copyright (C) 2003-2008
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
@@ -122 +122 @@
   {
   public:
-  
+
     /// The type of the digraph
     typedef typename TR::Digraph Digraph;
@@ -153 +153 @@
 
     TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);
-  
+
     // The digraph the algorithm runs on
     const Digraph &_gr;
@@ -180 +180 @@
     std::vector<Node>* _nodes;
     typename Digraph::template NodeMap<std::vector<Arc> > _in_arcs;
-    
+
     // Queue used for BFS search
     std::vector<Node> _queue;
@@ -186 +186 @@
 
     Tolerance _tolerance;
-  
+
     // Infinite constant
     const LargeCost INF;
 
   public:
-  
+
     /// \name Named Template Parameters
     /// @{
@@ -229 +229 @@
       typedef HowardMmc<GR, CM, SetPathTraits<T> > Create;
     };
-    
+
     /// @}
 
@@ -335 +335 @@
       init();
       findComponents();
-      
+
       // Find the minimum cycle mean in the components
       for (int comp = 0; comp < _comp_num; ++comp) {
@@ -446 +446 @@
       _cycle_path->clear();
     }
-    
+
     // Find strongly connected components and initialize _comp_nodes
     // and _in_arcs