Use copressed node-based graph for segregated edges check.

include/extractor/node_based_graph_factory.hpp

@@ -36,11 +36,10 @@ class NodeBasedGraphFactory
     // node-based graph to represent the OSM network. This includes geometry compression, annotation
     // data optimisation and many other aspects. After this step, the edge-based graph factory can
     // turn the graph into the routing graph to be used with the navigation algorithms.
-    NodeBasedGraphFactory(const boost::filesystem::path &input_file);
-
-    void CompressAll(ScriptingEnvironment &scripting_environment,
-                     std::vector<TurnRestriction> &turn_restrictions,
-                     std::vector<ConditionalTurnRestriction> &conditional_turn_restrictions);
+    NodeBasedGraphFactory(const boost::filesystem::path &input_file,
+                          ScriptingEnvironment &scripting_environment,
+                          std::vector<TurnRestriction> &turn_restrictions,
+                          std::vector<ConditionalTurnRestriction> &conditional_turn_restrictions);
 
     auto &GetGraph() { return compressed_output_graph; }
     auto const &GetBarriers() const { return barriers; }
@@ -76,7 +75,7 @@ class NodeBasedGraphFactory
     // unreferenced entries
     void CompressAnnotationData();
 
-    // After produce, this will contain a compresse version of the node-based graph
+    // After produce, this will contain a compressed version of the node-based graph
     util::NodeBasedDynamicGraph compressed_output_graph;
     // To store the meta-data for the graph that is purely annotative / not used for the navigation
     // itself. Since the edges of a node-based graph form the nodes of the edge based graphs, we