diff -r 172ce6c3ac6e -r 90f8696360b2 src/lemon/graph_utils.h
--- a/src/lemon/graph_utils.h	Wed Jan 05 12:26:59 2005 +0000
+++ b/src/lemon/graph_utils.h	Wed Jan 05 14:34:00 2005 +0000
@@ -103,17 +103,33 @@
     return _countEdges<Graph>(g);
   }
 
-  /// \brief Function to count 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 symmetric 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);
+  inline int countUndirEdges(const Graph& g) {
+    return _countUndirEdges<Graph>(g);
   }
 
 
+
   template <typename Graph, typename DegIt>
   inline int countNodeDegree(const Graph& _g, const typename Graph::Node& _n) {
     int num = 0;