Changeset 1909:2d806130e700 in lemon-0.x for lemon/grid_graph.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/grid_graph.h (modified) (6 diffs)

lemon/grid_graph.h

@@ -339 +339 @@
 
 
-  typedef StaticMappableUndirGraphExtender<
-    IterableUndirGraphExtender<
-    AlterableUndirGraphExtender<
-    UndirGraphExtender<GridGraphBase> > > > ExtendedGridGraphBase;
+  typedef StaticMappableUGraphExtender<
+    IterableUGraphExtender<
+    AlterableUGraphExtender<
+    UGraphExtender<GridGraphBase> > > > ExtendedGridGraphBase;
 
   /// \ingroup graphs
@@ -365 +365 @@
   /// \endcode
   ///
-  /// The graph type is fully conform to the \ref concept::UndirGraph
+  /// The graph type is fully conform to the \ref concept::UGraph
   /// "Undirected Graph" concept.
   ///
@@ -464 +464 @@
     /// outgoing edge then it gives back INVALID.
     Edge down(Node n) const {
-      UndirEdge ue = _down(n);
+      UEdge ue = _down(n);
       return ue != INVALID ? direct(ue, true) : INVALID;
     }
@@ -473 +473 @@
     /// outgoing edge then it gives back INVALID.
     Edge up(Node n) const {
-      UndirEdge ue = _up(n);
+      UEdge ue = _up(n);
       return ue != INVALID ? direct(ue, false) : INVALID;
     }
@@ -482 +482 @@
     /// outgoing edge then it gives back INVALID.
     Edge right(Node n) const {
-      UndirEdge ue = _right(n);
+      UEdge ue = _right(n);
       return ue != INVALID ? direct(ue, true) : INVALID;
     }
@@ -491 +491 @@
     /// outgoing edge then it gives back INVALID.
     Edge left(Node n) const {
-      UndirEdge ue = _left(n);
+      UEdge ue = _left(n);
       return ue != INVALID ? direct(ue, false) : INVALID;
     }