pastk/organicmaps
1
Fork 0
forked from organicmaps/organicmaps
Code Pull requests Activity

[pedestrian] Added TODO comment to Graph::GetAdjacencyList method.

Browse source
This commit is contained in:
Yuri Gorshenin 2015-04-20 17:33:41 +03:00 • committed by Alex Zolotarev
parent 94acca19be
commit 5d098f5e54
1 changed files with 7 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
routing/base/graph.hpp
View file

@ -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);