Changeset 2399:ccf2a1fa1821 in lemon-0.x for lemon/steiner.h

Timestamp:

03/07/07 12:57:51 (17 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

More query functions

File:

• lemon/steiner.h (modified) (3 diffs)

lemon/steiner.h

@@ -126 +126 @@
     FilterMap *_filter;
     TreeMap *_tree;
+
+    Value _value;
 
   public:
@@ -248 +250 @@
       }
 
-      prim(nodeSubUGraphAdaptor(_graph, *_filter), _cost, *_tree);
+      _value = prim(nodeSubUGraphAdaptor(_graph, *_filter), _cost, *_tree);
             
     }
@@ -269 +271 @@
       return (*_filter)[n];
     }
-    
-
+
+    /// \brief Checks if the node is a Steiner-node.
+    ///
+    /// Checks if the node is a Steiner-node (i.e. a tree node but
+    /// not terminal).
+    /// \param n is the node that will be checked
+    /// \return \c true if n is a Steiner-node, \c false otherwise
+    bool steiner(Node n){
+      return (*_filter)[n] && (*_pred)[n] != INVALID;
+    }
+
+    /// \brief Checks if the node is a terminal.
+    ///
+    /// Checks if the node is a terminal.
+    /// \param n is the node that will be checked
+    /// \return \c true if n is a terminal, \c false otherwise
+    bool terminal(Node n){
+      return _dijkstra.reached(n) && (*_pred)[n] == INVALID;
+    }
+    
+    /// \brief The total cost of the tree
+    ///
+    /// The total cost of the constructed tree. The calculated value does
+    /// not exceed the double of the optimal value.
+    Value treeValue() const {
+      return _value;
+    }
+    
   };