compiling with g++ 7.4

Author: srohit0

src/bgaMain.cpp

@@ -9,6 +9,7 @@
 // with a basic text user interface for all algorithms.
 //
 
+#include "dvector.h"
 #include "scc.h"
 #include "dfs.h"
 #include "mst.h"

src/graph.h

@@ -14,6 +14,7 @@
 #include <sstream>
 #include <set>
 #include <vector>
+#include <limits.h>
 
 using namespace std;
 
@@ -184,4 +185,4 @@ namespace basicGraph {
 	};
 }
 
-#endif //BASIC_GRAPH_H
+#endif //BASIC_GRAPH_H

src/mst.h

@@ -47,11 +47,13 @@ namespace MST {
 		virtual void build() = 0;
 		bool nodePartOfMST(const basicGraph::bNode* gnode)
 		{
-			return tree_.find(&treeNode(gnode)) != tree_.end();
+            treeNode tmpTreeNode = treeNode(gnode);
+			return tree_.find(&tmpTreeNode) != tree_.end();
 		}
 		treeNode* getTreeNode(const basicGraph::bNode* gnode)
 		{
-			set<treeNode*, treeNodeCompare>::iterator niter = tree_.find(&treeNode(gnode));
+            treeNode tmpTreeNode = treeNode(gnode);
+			set<treeNode*, treeNodeCompare>::iterator niter = tree_.find(&tmpTreeNode);
 			return niter == tree_.end() ? nullptr : *niter;
 		}
 		void print(bool edges_only=false)
@@ -177,8 +179,10 @@ namespace MST {
 			{
 				const basicGraph::bNode* u = sortedEdges[i]->n1();
 				const basicGraph::bNode* v = sortedEdges[i]->n2();
-				auto uset = tree_.find(&treeNode(u));
-				auto vset = tree_.find(&treeNode(v));
+                treeNode tmpUNode = treeNode(u);
+                treeNode tmpVNode = treeNode(v);
+				auto uset = tree_.find(&tmpUNode);
+				auto vset = tree_.find(&tmpVNode);
 				if (uset != tree_.end() && vset != tree_.end() && 
 					(*uset)->iset_ != (*vset)->iset_ )
 				{
@@ -297,4 +301,5 @@ namespace MST {
 	};
 }
 
-#endif GRAPH_MST_H
+#endif 
+

src/shortestPath.h

@@ -68,7 +68,8 @@ namespace short_paths {
 		pathNode* src() { return src_; }
 		pathNode* retrievePathNode(const basicGraph::bNode* gnode)
 		{
-			set<pathNode*, pathNodeCompare>::iterator niter = tree_.find(&pathNode(gnode));
+            pathNode tmpNode = pathNode(gnode);
+			set<pathNode*, pathNodeCompare>::iterator niter = tree_.find(&tmpNode);
 			return niter == tree_.end() ? nullptr : *niter;
 		}
 		pathNode* retrieveOrAddPathNode(const basicGraph::bNode* gnode)
@@ -405,4 +406,4 @@ namespace short_paths {
 	};
 }
 
-#endif
+#endif