Changeset 2518:4c0a23bd70b5 in lemon-0.x for lemon/elevator.h

Timestamp:

11/21/07 14:34:38 (16 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3394

Message:

Bugfix in min cut computation

File:

• lemon/elevator.h (modified) (4 diffs)

lemon/elevator.h

@@ -51 +51 @@
   class Elevator 
   {
-  private:
+  public:
 
     typedef Item Key;
     typedef int Value;
+
+  private:
 
     typedef typename std::vector<Item>::iterator Vit;
@@ -377 +379 @@
       _level[i]=new_level;
       if(new_level>_highest_active) _highest_active=new_level;
+    }
+
+    ///Mark the node as it did not reach the max level
+    
+    ///Mark the node as it did not reach the max level. It sets the
+    ///level of the node to a low value, which is not connected to the
+    ///real levels of elevator. The node should be lifted previously
+    ///to the top level.
+    void markToBottom(Item i) {
+      _level[i] = - _max_level;
     }
     
@@ -492 +504 @@
   template <class Graph, class Item>
   class LinkedElevator {
-  private:
+  public:
 
     typedef Item Key;
     typedef int Value;
+
+  private:
 
     typedef typename ItemSetTraits<Graph,Item>::
@@ -883 +897 @@
     }
     
+    ///Mark the node as it did not reach the max level
+    
+    ///Mark the node as it did not reach the max level. It sets the
+    ///level of the node to a low value, which is not connected to the
+    ///real levels of elevator. The node should be lifted previously
+    ///to the top level.
+    void markToBottom(Item i) {
+      _level[i] = - _max_level;
+    }
+
     ///Lift all nodes on and above a level to the top (and deactivate them).