Fixes compile errors in benchamarks

Author: JustCallMeRay

benchmark/Dial_BM.cpp

@@ -7,7 +7,7 @@ static void Dial_X(benchmark::State &state) {
   CXXGraph::Graph<int> g;
   auto range_start = edges.begin();
   auto range_end = edges.find(state.range(0));
-  CXXGraph::Mapgned long, CXXGraph::Edge<int> *> edgesX;
+  CXXGraph::Map<unsigned long, CXXGraph::Edge<int> *> edgesX;
   edgesX.insert(range_start, range_end);
   for (auto e : edgesX) {
     g.addEdge(&(*e.second));

benchmark/EulerPath_BM.cpp

@@ -7,7 +7,7 @@ static void EulerPath_X(benchmark::State &state) {
   CXXGraph::Graph<int> g;
   auto range_start = undirectedEdges.begin();
   auto range_end = undirectedEdges.find(state.range(0));
-  CXXGraph::Maplong, CXXGraph::Edge<int> *> edgesX;
+  CXXGraph::Map<long, CXXGraph::Edge<int> *> edgesX;
   edgesX.insert(range_start, range_end);
   for (auto e : edgesX) {
     g.addEdge(&(*e.second));

benchmark/GraphSlicing_BM.cpp

@@ -7,7 +7,7 @@ static void GraphSlicing_X(benchmark::State &state) {
   CXXGraph::Graph<int> g;
   auto range_start = edges.begin();
   auto range_end = edges.find(state.range(0));
-  CXXGraph::Mapgned long, CXXGraph::Edge<int> *> edgesX;
+  CXXGraph::Map<unsigned long, CXXGraph::Edge<int> *> edgesX;
   edgesX.insert(range_start, range_end);
   for (auto e : edgesX) {
     g.addEdge(&(*e.second));