From fcd4c4ff300a8496718ed2a0b5ddbda9d03161e6 Mon Sep 17 00:00:00 2001
From: dmatetelki <denes.matetelki@emerson.com>
Date: Mon, 24 Aug 2015 14:43:09 +0200
Subject: [PATCH] source is not in q

---
 lib/graph/graph_algorithms.hpp | 11 ++++++-----
 1 file changed, 6 insertions(+), 5 deletions(-)

diff --git a/lib/graph/graph_algorithms.hpp b/lib/graph/graph_algorithms.hpp
index 3042a9d..e928d1c 100644
--- a/lib/graph/graph_algorithms.hpp
+++ b/lib/graph/graph_algorithms.hpp
@@ -54,15 +54,16 @@ dijkstra_shortest_path_to(const Graph<V>& graph,
                           const V& dest,
                           std::function<W(V, V)> distanceCompute)
 {
-  std::unordered_map<V, W> dist; /// @todo into std::priority_queue<std::pair<V< W>>
+  std::unordered_map<V, W> dist;
   std::unordered_map<V, V> prev;
 
   dist.emplace(source, W());
-
   std::unordered_set<V> q;
-  q.insert(source);
-  const std::vector<V>& s_n = graph.neighboursOf(source);
-  std::copy(s_n.begin(), s_n.end(), std::inserter(q, q.end()));
+  for (const auto& v : graph.neighboursOf(source)) {
+    q.insert(v);
+    dist[v] = distanceCompute(source, v);
+    prev[v] = source;
+  }
 
   while (!q.empty()) {
     const V& u = closestNode<V, W>(q, dist);