diff -r 39b6e65574c6 -r 0759d974de81 lemon/bits/graph_extender.h
--- a/lemon/bits/graph_extender.h	Thu Apr 02 22:34:03 2015 +0200
+++ b/lemon/bits/graph_extender.h	Sun Jan 05 22:24:56 2014 +0100
@@ -27,6 +27,8 @@
 #include <lemon/concept_check.h>
 #include <lemon/concepts/maps.h>
 
+#include <lemon/bits/stl_iterators.h>
+
 //\ingroup graphbits
 //\file
 //\brief Extenders for the graph types
@@ -116,6 +118,10 @@
 
     };
 
+    LemonRangeWrapper1<NodeIt, Digraph> nodes() const {
+      return LemonRangeWrapper1<NodeIt, Digraph>(*this);
+    }
+
 
     class ArcIt : public Arc {
       const Digraph* _digraph;
@@ -139,6 +145,10 @@
 
     };
 
+    LemonRangeWrapper1<ArcIt, Digraph> arcs() const {
+      return LemonRangeWrapper1<ArcIt, Digraph>(*this);
+    }
+
 
     class OutArcIt : public Arc {
       const Digraph* _digraph;
@@ -163,6 +173,10 @@
 
     };
 
+    LemonRangeWrapper2<OutArcIt, Digraph, Node> outArcs(const Node& u) const {
+      return LemonRangeWrapper2<OutArcIt, Digraph, Node>(*this, u);
+    }
+
 
     class InArcIt : public Arc {
       const Digraph* _digraph;
@@ -187,6 +201,10 @@
 
     };
 
+    LemonRangeWrapper2<InArcIt, Digraph, Node> inArcs(const Node& u) const {
+      return LemonRangeWrapper2<InArcIt, Digraph, Node>(*this, u);
+    }
+
     // \brief Base node of the iterator
     //
     // Returns the base node (i.e. the source in this case) of the iterator
@@ -436,6 +454,10 @@
 
     };
 
+    LemonRangeWrapper1<NodeIt, Graph> nodes() const {
+      return LemonRangeWrapper1<NodeIt, Graph>(*this);
+    }
+
 
     class ArcIt : public Arc {
       const Graph* _graph;
@@ -459,6 +481,10 @@
 
     };
 
+    LemonRangeWrapper1<ArcIt, Graph> arcs() const {
+      return LemonRangeWrapper1<ArcIt, Graph>(*this);
+    }
+
 
     class OutArcIt : public Arc {
       const Graph* _graph;
@@ -483,6 +509,10 @@
 
     };
 
+    LemonRangeWrapper2<OutArcIt, Graph, Node> outArcs(const Node& u) const {
+      return LemonRangeWrapper2<OutArcIt, Graph, Node>(*this, u);
+    }
+
 
     class InArcIt : public Arc {
       const Graph* _graph;
@@ -507,6 +537,10 @@
 
     };
 
+    LemonRangeWrapper2<InArcIt, Graph, Node> inArcs(const Node& u) const {
+      return LemonRangeWrapper2<InArcIt, Graph, Node>(*this, u);
+    }
+
 
     class EdgeIt : public Parent::Edge {
       const Graph* _graph;
@@ -530,6 +564,11 @@
 
     };
 
+    LemonRangeWrapper1<EdgeIt, Graph> edges() const {
+      return LemonRangeWrapper1<EdgeIt, Graph>(*this);
+    }
+
+
     class IncEdgeIt : public Parent::Edge {
       friend class GraphExtender;
       const Graph* _graph;
@@ -555,6 +594,11 @@
       }
     };
 
+    LemonRangeWrapper2<IncEdgeIt, Graph, Node> incEdges(const Node& u) const {
+      return LemonRangeWrapper2<IncEdgeIt, Graph, Node>(*this, u);
+    }
+
+
     // \brief Base node of the iterator
     //
     // Returns the base node (ie. the source in this case) of the iterator
@@ -903,6 +947,11 @@
 
     };
 
+    LemonRangeWrapper1<NodeIt, BpGraph> nodes() const {
+      return LemonRangeWrapper1<NodeIt, BpGraph>(*this);
+    }
+
+
     class RedNodeIt : public RedNode {
       const BpGraph* _graph;
     public:
@@ -925,6 +974,11 @@
 
     };
 
+    LemonRangeWrapper1<RedNodeIt, BpGraph> redNodes() const {
+      return LemonRangeWrapper1<RedNodeIt, BpGraph>(*this);
+    }
+
+
     class BlueNodeIt : public BlueNode {
       const BpGraph* _graph;
     public:
@@ -947,6 +1001,11 @@
 
     };
 
+    LemonRangeWrapper1<BlueNodeIt, BpGraph> blueNodes() const {
+      return LemonRangeWrapper1<BlueNodeIt, BpGraph>(*this);
+    }
+
+
 
     class ArcIt : public Arc {
       const BpGraph* _graph;
@@ -970,6 +1029,10 @@
 
     };
 
+    LemonRangeWrapper1<ArcIt, BpGraph> arcs() const {
+      return LemonRangeWrapper1<ArcIt, BpGraph>(*this);
+    }
+
 
     class OutArcIt : public Arc {
       const BpGraph* _graph;
@@ -994,6 +1057,10 @@
 
     };
 
+    LemonRangeWrapper2<OutArcIt, BpGraph, Node> outArcs(const Node& u) const {
+      return LemonRangeWrapper2<OutArcIt, BpGraph, Node>(*this, u);
+    }
+
 
     class InArcIt : public Arc {
       const BpGraph* _graph;
@@ -1018,6 +1085,10 @@
 
     };
 
+    LemonRangeWrapper2<InArcIt, BpGraph, Node> inArcs(const Node& u) const {
+      return LemonRangeWrapper2<InArcIt, BpGraph, Node>(*this, u);
+    }
+
 
     class EdgeIt : public Parent::Edge {
       const BpGraph* _graph;
@@ -1041,6 +1112,11 @@
 
     };
 
+    LemonRangeWrapper1<EdgeIt, BpGraph> edges() const {
+      return LemonRangeWrapper1<EdgeIt, BpGraph>(*this);
+    }
+
+
     class IncEdgeIt : public Parent::Edge {
       friend class BpGraphExtender;
       const BpGraph* _graph;
@@ -1066,6 +1142,11 @@
       }
     };
 
+    LemonRangeWrapper2<IncEdgeIt, BpGraph, Node> incEdges(const Node& u) const {
+      return LemonRangeWrapper2<IncEdgeIt, BpGraph, Node>(*this, u);
+    }
+
+
     // \brief Base node of the iterator
     //
     // Returns the base node (ie. the source in this case) of the iterator