Changeset 1053:90f8696360b2 in lemon-0.x for src/lemon/graph_utils.h

Timestamp:

01/05/05 15:34:00 (19 years ago)

Author:

Mihaly Barasz

Branch:

default

Phase:

public

Convert:

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

Message:

UndirGraphs?: invalid edge bug

File:

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

src/lemon/graph_utils.h

@@ -104 +104 @@
   }
 
-  /// \brief Function to count the symmetric edges in the graph.
-  ///
-  /// This function counts the symmetric edges in the graph.
+  // Undirected edge counting:
+
+  template <typename Graph>
+  inline
+  typename enable_if<typename Graph::EdgeNumTag, int>::type
+  _countUndirEdges(const Graph &g) {
+    return g.undirEdgeNum();
+  }
+
+  template <typename Graph>
+  inline int _countUndirEdges(Wrap<Graph> w) {
+    return countItems<Graph, typename Graph::UndirEdgeIt>(w.value);
+  }
+
+  /// \brief Function to count the edges in the graph.
+  ///
+  /// This function counts the edges in the graph.
   /// The complexity of the function is O(e) but for some
   /// graph structure it is specialized to run in O(1).
-  template <typename Graph>
-  inline int countSymEdges(const Graph& _g) {
-    return countItems<Graph, typename Graph::SymEdgeIt>(_g);
-  }
+
+  template <typename Graph>
+  inline int countUndirEdges(const Graph& g) {
+    return _countUndirEdges<Graph>(g);
+  }
+