From 4401b58f45ad0781b6dfc591336996bddca236c3 Mon Sep 17 00:00:00 2001
From: DennisOSRM <luxen@kit.edu>
Date: Sat, 14 Apr 2012 15:07:02 +0200
Subject: [PATCH] Adding a little more verbosity during construction of
 external memory data structure

---
 Contractor/EdgeBasedGraphFactory.cpp | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/Contractor/EdgeBasedGraphFactory.cpp b/Contractor/EdgeBasedGraphFactory.cpp
index a2d69e245..bfa09d84d 100644
--- a/Contractor/EdgeBasedGraphFactory.cpp
+++ b/Contractor/EdgeBasedGraphFactory.cpp
@@ -260,8 +260,12 @@ void EdgeBasedGraphFactory::Run() {
         }
         p.printIncrement();
     }
+    INFO("Sorting edge-based Nodes");
     std::sort(edgeBasedNodes.begin(), edgeBasedNodes.end());
+    INFO("Removing duplicate nodes (if any)");
     edgeBasedNodes.erase( std::unique(edgeBasedNodes.begin(), edgeBasedNodes.end()), edgeBasedNodes.end() );
+    INFO("Applying vector self-swap trick to free up memory");
+    edgeBasedNodes.swap(edgeBasedNodes);
     INFO("Node-based graph contains " << nodeBasedEdgeCounter     << " edges");
     INFO("Edge-based graph contains " << edgeBasedEdges.size()    << " edges, blowup is " << (double)edgeBasedEdges.size()/(double)nodeBasedEdgeCounter);
     INFO("Edge-based graph skipped "  << numberOfSkippedTurns     << " turns, defined by " << numberOfTurnRestrictions << " restrictions.");