Changeset 1909:2d806130e700 in lemon-0.x for lemon/euler.h

Timestamp:

01/26/06 16:42:13 (18 years ago)

Author:

Mihaly Barasz

Branch:

default

Phase:

public

Convert:

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

Message:

Undir -> U transition

File:

• lemon/euler.h (modified) (8 diffs)

lemon/euler.h

@@ -125 +125 @@
   ///Euler tour of \c g.
   ///\code
-  ///  for(UndirEulerIt<UndirListGraph> e(g),e!=INVALID;++e) {
-  ///    std::cout << g.id(UndirEdge(e)) << std::eol;
+  ///  for(UEulerIt<ListUGraph> e(g),e!=INVALID;++e) {
+  ///    std::cout << g.id(UEdge(e)) << std::eol;
   ///  }
   ///\endcode
   ///Although the iterator provides an Euler tour of an undirected graph,
-  ///in order to indicate the direction of the tour, UndirEulerIt
+  ///in order to indicate the direction of the tour, UEulerIt
   ///returns directed edges (that convert to the undirected ones, of course).
   ///
@@ -136 +136 @@
   ///\todo Test required
   template<class Graph>
-  class UndirEulerIt
+  class UEulerIt
   {
     typedef typename Graph::Node Node;
@@ -147 +147 @@
     const Graph &g;
     typename Graph::NodeMap<OutEdgeIt> nedge;
-    typename Graph::UndirEdgeMap<bool> visited;
+    typename Graph::UEdgeMap<bool> visited;
     std::list<Edge> euler;
 
@@ -157 +157 @@
     ///\param start The starting point of the tour. If it is not given
     ///       the tour will start from the first node.
-    UndirEulerIt(const Graph &_g,typename Graph::Node start=INVALID)
+    UEulerIt(const Graph &_g,typename Graph::Node start=INVALID)
       : g(_g), nedge(g), visited(g,false)
     {
@@ -176 +176 @@
     
     ///Next edge of the tour
-    UndirEulerIt &operator++() {
+    UEulerIt &operator++() {
       Node s=g.target(euler.front());
       euler.pop_front();
@@ -197 +197 @@
     
     ///\warning This incrementation
-    ///returns an \c Edge, not an \ref UndirEulerIt, as one may
+    ///returns an \c Edge, not an \ref UEulerIt, as one may
     ///expect.
     Edge operator++(int) 
@@ -225 +225 @@
   bool
 #else
-  typename enable_if<typename Graph::UndirTag,bool>::type
+  typename enable_if<typename Graph::UTag,bool>::type
   euler(const Graph &g) 
   {
@@ -233 +233 @@
   }
   template<class Graph>
-  typename disable_if<typename Graph::UndirTag,bool>::type
+  typename disable_if<typename Graph::UTag,bool>::type
 #endif
   euler(const Graph &g)