Simplified a bit find_shortest_path.

[mtp.git] / mtp_graph.h

diff --git a/mtp_graph.h b/mtp_graph.h
index e0f40e9..33a29f5 100644 (file)
--- a/mtp_graph.h
+++ b/mtp_graph.h
@@ -71,7 +71,6 @@ class MTPGraph {
 
   // For Dijkstra
   Vertex **_heap;
-  int _heap_size;
 
   // Updating the distances from the source in that order will work in
   // the original graph (which has to be a DAG)