From 5d098f5e5414f624e02a9d4cd62aca76fbb3fea2 Mon Sep 17 00:00:00 2001
From: Yuri Gorshenin <y@maps.me>
Date: Mon, 20 Apr 2015 17:33:41 +0300
Subject: [PATCH] [pedestrian] Added TODO comment to Graph::GetAdjacencyList
 method.

---
 routing/base/graph.hpp | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/routing/base/graph.hpp b/routing/base/graph.hpp
index ee4849299e..666f332f78 100644
--- a/routing/base/graph.hpp
+++ b/routing/base/graph.hpp
@@ -12,6 +12,13 @@ public:
   using TVertexType = TVertex;
   using TEdgeType = TEdge;
 
+  /// TODO (@gorshenin, @pimenov, @ldragunov): for bidirectional
+  /// algorithms this method should be replaced by two:
+  /// GetOutgoingEdges() and GetIngoingEdges(). They should be
+  /// identical for undirected graphs, but may differ on directed. The
+  /// reason is that forward pass of routing algorithms should use
+  /// only GetOutgoingEdges() while backward pass should use only
+  /// GetIngoingEdges().
   void GetAdjacencyList(TVertexType const & v, vector<TEdgeType> & adj) const
   {
     return GetImpl().GetAdjacencyListImpl(v, adj);