Changeset 2029:e00114f165f5 in lemon-0.x for lemon/graph_utils.h

Timestamp:

04/03/06 10:41:52 (18 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Count ANodes-BNodes

File:

• lemon/graph_utils.h (modified) (1 diff)

lemon/graph_utils.h

@@ -146 +146 @@
   inline int countNodes(const Graph& g) {
     return _graph_utils_bits::CountNodesSelector<Graph>::count(g);
+  }
+
+  namespace _graph_utils_bits {
+    
+    template <typename Graph, typename Enable = void>
+    struct CountANodesSelector {
+      static int count(const Graph &g) {
+        return countItems<Graph, typename Graph::ANode>(g);
+      }
+    };
+
+    template <typename Graph>
+    struct CountANodesSelector<
+      Graph, typename 
+      enable_if<typename Graph::NodeNumTag, void>::type> 
+    {
+      static int count(const Graph &g) {
+        return g.nodeNum();
+      }
+    };    
+  }
+
+  /// \brief Function to count the anodes in the graph.
+  ///
+  /// This function counts the anodes in the graph.
+  /// The complexity of the function is O(an) but for some
+  /// graph structures it is specialized to run in O(1).
+  ///
+  /// \todo refer how to specialize it
+
+  template <typename Graph>
+  inline int countANodes(const Graph& g) {
+    return _graph_utils_bits::CountANodesSelector<Graph>::count(g);
+  }
+
+  namespace _graph_utils_bits {
+    
+    template <typename Graph, typename Enable = void>
+    struct CountBNodesSelector {
+      static int count(const Graph &g) {
+        return countItems<Graph, typename Graph::BNode>(g);
+      }
+    };
+
+    template <typename Graph>
+    struct CountBNodesSelector<
+      Graph, typename 
+      enable_if<typename Graph::NodeNumTag, void>::type> 
+    {
+      static int count(const Graph &g) {
+        return g.nodeNum();
+      }
+    };    
+  }
+
+  /// \brief Function to count the bnodes in the graph.
+  ///
+  /// This function counts the bnodes in the graph.
+  /// The complexity of the function is O(bn) but for some
+  /// graph structures it is specialized to run in O(1).
+  ///
+  /// \todo refer how to specialize it
+
+  template <typename Graph>
+  inline int countBNodes(const Graph& g) {
+    return _graph_utils_bits::CountBNodesSelector<Graph>::count(g);
   }