use range based for loops to traverse graphs

Server/DataStructures/BaseDataFacade.h

@@ -38,10 +38,14 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 #include "../../Util/StringUtil.h"
 #include "../../typedefs.h"
 
+#include <boost/range/irange.hpp>
+
 #include <osrm/Coordinate.h>
 
 #include <string>
 
+typedef decltype(boost::irange(0u,0u)) EdgeRange;
+
 template <class EdgeDataT> class BaseDataFacade
 {
   public:
@@ -67,6 +71,8 @@ template <class EdgeDataT> class BaseDataFacade
 
     virtual EdgeID EndEdges(const NodeID n) const = 0;
 
+    virtual EdgeRange GetAdjacentEdgeRange(const NodeID node) const = 0;
+
     // searches for a specific edge
     virtual EdgeID FindEdge(const NodeID from, const NodeID to) const = 0;
 

Server/DataStructures/InternalDataFacade.h

@@ -309,6 +309,8 @@ template <class EdgeDataT> class InternalDataFacade : public BaseDataFacade<Edge
 
     EdgeID EndEdges(const NodeID n) const { return m_query_graph->EndEdges(n); }
 
+    EdgeRange GetAdjacentEdgeRange(const NodeID node) const { return m_query_graph->GetAdjacentEdgeRange(node); };
+
     // searches for a specific edge
     EdgeID FindEdge(const NodeID from, const NodeID to) const
     {

Server/DataStructures/SharedDataFacade.h

@@ -254,6 +254,8 @@ template <class EdgeDataT> class SharedDataFacade : public BaseDataFacade<EdgeDa
 
     EdgeID EndEdges(const NodeID n) const { return m_query_graph->EndEdges(n); }
 
+    EdgeRange GetAdjacentEdgeRange(const NodeID node) const { return m_query_graph->GetAdjacentEdgeRange(node); };
+
     // searches for a specific edge
     EdgeID FindEdge(const NodeID from, const NodeID to) const
     {