diff --git a/src/dijkstra.cpp b/src/dijkstra.cpp
index e3089e29244c33660356ea4f3ef06a2632dfdcf3..aaaf89b9b849be76047d60d465352ab18dd66c25 100644
--- a/src/dijkstra.cpp
+++ b/src/dijkstra.cpp
@@ -95,10 +95,10 @@ double CDijkstra::find_shortest_path(Eigen::MatrixXd &graph,unsigned int start_n
     new_d2=d2.block(1,0,d2.rows()-1,2);
     for(i=0;i<new_d2.rows();i++)
     {
-      if(d(new_d2(i,1),0)>(d(k,0)+int_graph(k,new_d2(i,1))))
+      if(d((int)new_d2(i,1),0)>(d(k,0)+int_graph(k,(int)new_d2(i,1))))
       {
-        d(new_d2(i,1),0)=d(k,0)+int_graph(k,new_d2(i,1));
-        new_d2(i,0)=d(new_d2(i,1),0); 
+        d((int)new_d2(i,1),0)=d(k,0)+int_graph(k,(int)new_d2(i,1));
+        new_d2(i,0)=d((int)new_d2(i,1),0); 
       }
     }
     for(i=1;i<int_graph.rows();i++)