diff --git a/DataStructures/StaticGraph.h b/DataStructures/StaticGraph.h index 8c086a664..6a83e928c 100644 --- a/DataStructures/StaticGraph.h +++ b/DataStructures/StaticGraph.h @@ -97,10 +97,8 @@ public: #ifndef NDEBUG Percent p(GetNumberOfNodes()); for(unsigned u = 0; u < GetNumberOfNodes(); ++u) { - SimpleLogger().Write() << "[" << u << "], 1st: " << BeginEdges(u) << ", last: " << EndEdges(u); for(unsigned eid = BeginEdges(u); eid < EndEdges(u); ++eid) { unsigned v = GetTarget(eid); - SimpleLogger().Write() << "Edge (" << u << "," << v << ")"; EdgeData & data = GetEdgeData(eid); if(data.shortcut) { unsigned eid2 = FindEdgeInEitherDirection(u, data.id); diff --git a/createHierarchy.cpp b/createHierarchy.cpp index 66706342e..d0eadc14c 100644 --- a/createHierarchy.cpp +++ b/createHierarchy.cpp @@ -269,7 +269,6 @@ int main (int argc, char *argv[]) { std::ofstream hsgr_output_stream(graphOut.c_str(), std::ios::binary); hsgr_output_stream.write((char*)&uuid_orig, sizeof(UUID) ); BOOST_FOREACH(const QueryEdge & edge, contractedEdgeList) { - SimpleLogger().Write() << "edge (" << edge.source << "," << edge.target << ")"; if(edge.source > numberOfNodes) { numberOfNodes = edge.source; } @@ -290,18 +289,10 @@ int main (int argc, char *argv[]) { ++edge; _nodes[node].firstEdge = position; //=edge position += edge - lastEdge; //remove - SimpleLogger().Write() << "_nodes[" << node << "].firstEdge = " << _nodes[node].firstEdge; } _nodes[_nodes.size()-1].firstEdge = _nodes[_nodes.size()-2].firstEdge; - SimpleLogger().Write() << "position: " << position; ++numberOfNodes; - SimpleLogger().Write() << "no. of nodes: " << numberOfNodes << ", edges: " << edge; - SimpleLogger().Write() << "_nodes.size(): " << _nodes.size(); - for(unsigned i = 0; i < _nodes.size(); ++i) { - SimpleLogger().Write() << _nodes[i].firstEdge; - } - BOOST_ASSERT_MSG(_nodes.size() == numberOfNodes, "no. of nodes dont match"); //Serialize numberOfNodes, nodes