Open-Harbor/osrm-backend
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 3 Wiki Activity

Making edge factor more verbose

Browse Source
This commit is contained in:
Dennis Luxen 2013-08-16 11:08:07 +02:00
parent b7980b83df
commit cf29621aa7
1 changed files with 10 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
Contractor/EdgeBasedGraphFactory.cpp
View File

@ -292,6 +292,8 @@ void EdgeBasedGraphFactory::Run(
} }
SimpleLogger().Write() << SimpleLogger().Write() <<
"identified: " << component_size_list.size() << " many components"; "identified: " << component_size_list.size() << " many components";
SimpleLogger().Write() <<
"generating edge-expanded nodes";
p.reinit(m_node_based_graph->GetNumberOfNodes()); p.reinit(m_node_based_graph->GetNumberOfNodes());
//loop over all edges and generate new set of nodes. //loop over all edges and generate new set of nodes.
@ -301,6 +303,7 @@ void EdgeBasedGraphFactory::Run(
u < number_of_nodes; u < number_of_nodes;
++u ++u
) { ) {
p.printIncrement();
for( for(
EdgeIterator e1 = m_node_based_graph->BeginEdges(u), EdgeIterator e1 = m_node_based_graph->BeginEdges(u),
last_edge = m_node_based_graph->EndEdges(u); last_edge = m_node_based_graph->EndEdges(u);
@ -325,6 +328,12 @@ void EdgeBasedGraphFactory::Run(
} }
} }
SimpleLogger().Write()
<< "Generated " << m_edge_based_node_list.size() << " nodes in " <<
"edge-expanded graph";
SimpleLogger().Write() <<
"generating edge-expanded edges";
std::vector<NodeID>().swap(component_size_list); std::vector<NodeID>().swap(component_size_list);
BOOST_ASSERT_MSG( BOOST_ASSERT_MSG(
0 == component_size_list.capacity(), 0 == component_size_list.capacity(),
@ -341,6 +350,7 @@ void EdgeBasedGraphFactory::Run(
//Loop over all turns and generate new set of edges. //Loop over all turns and generate new set of edges.
//Three nested loop look super-linear, but we are dealing with a (kind of) //Three nested loop look super-linear, but we are dealing with a (kind of)
//linear number of turns only. //linear number of turns only.
p.reinit(m_node_based_graph->GetNumberOfNodes());
for( for(
NodeIterator u = 0, NodeIterator u = 0,
last_node = m_node_based_graph->GetNumberOfNodes(); last_node = m_node_based_graph->GetNumberOfNodes();