Changeset 1030:c8a41699e613 in lemon-0.x for src/lemon/iterable_graph_extender.h

Timestamp:

12/06/04 01:30:44 (19 years ago)

Author:

Mihaly Barasz

Branch:

default

Phase:

public

Convert:

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

Message:

Undirected graph documentation and concept refinements.

• quite a few bug fixes
• concept::UndirGraph? is almost complete and looks quite good.

File:

• src/lemon/iterable_graph_extender.h (modified) (5 diffs)

src/lemon/iterable_graph_extender.h

@@ -158 +158 @@
     };
 
-    class UndirIncEdgeIt : public UndirEdge { 
+    class IncEdgeIt : public UndirEdge { 
       const Graph* graph;
       bool forward;
@@ -166 +166 @@
     public:
 
-      UndirIncEdgeIt() { }
-
-      UndirIncEdgeIt(Invalid i) : UndirEdge(i), forward(false) { }
-
-      explicit UndirIncEdgeIt(const Graph& _graph, const Node &n)
+      IncEdgeIt() { }
+
+      IncEdgeIt(Invalid i) : UndirEdge(i), forward(false) { }
+
+      explicit IncEdgeIt(const Graph& _graph, const Node &n)
         : graph(&_graph)
       {
@@ -177 +177 @@
 
       // FIXME: Do we need this type of constructor here?
-      // UndirIncEdgeIt(const Graph& _graph, const Edge& e) : 
+      // IncEdgeIt(const Graph& _graph, const Edge& e) : 
       //   UndirEdge(e), graph(&_graph), forward(_graph.forward(e)) { }
       // or
-      // UndirIncEdgeIt(const Graph& _graph, const Node& n,
+      // IncEdgeIt(const Graph& _graph, const Node& n,
       //    Const UndirEdge &e) ... ?
 
-      UndirIncEdgeIt& operator++() {
+      IncEdgeIt& operator++() {
         graph->_dirNextOut(*this);
         return *this; 
@@ -189 +189 @@
     };
 
-    Node source(const UndirIncEdgeIt &e) const {
+    Node source(const IncEdgeIt &e) const {
       return _dirSource(e);
     }
@@ -198 +198 @@
 
     /// Target of the given Edge.
-    Node target(const UndirIncEdgeIt &e) const {
+    Node target(const IncEdgeIt &e) const {
       return _dirTarget(e);
     }