Commit de2168ae authored by Kučera Petr RNDr. Ph.D.'s avatar Kučera Petr RNDr. Ph.D.
Browse files

Removed comments

parent 61deb498
......@@ -246,29 +246,12 @@ Loco::LogicalGraph::FindInnerVertices(
// const auto [v, cross_count] = q.top();
const auto [v, d] = q.top();
q.pop();
/*
if (IsNode(v))
{
std::cout << "node " << v << ", " << NodeWithId(v)->Ident()
<< ", cc: " << cross_count << std::endl;
}
else
{
std::cout << "point " << v << ", " << PointWithId(v)->Ident()
<< ", cc: " << cross_count << std::endl;
}*/
if (state[v] == SEARCH_STATE::CLOSED)
{
// std::cout << "...already closed" << std::endl;
continue;
}
for (const auto &nb : mNeighbours[v])
{
/*std::cout << "...neighbour " << nb.mVertexId << "("
<< (IsNode(nb.mVertexId)
? NodeWithId(nb.mVertexId)->Ident()
: PointWithId(nb.mVertexId)->Ident())
<< ")" << std::endl;*/
switch (state[nb.mVertexId])
{
case SEARCH_STATE::TERMINAL:
......@@ -280,11 +263,9 @@ Loco::LogicalGraph::FindInnerVertices(
state[nb.mVertexId] = SEARCH_STATE::OPEN;
pred[nb.mVertexId] = v;
dist[nb.mVertexId] = new_dist; // dist[v] + nb.mDistance;
// std::cout << "......unvisited, new crosscount: "
//<< (IsNode(nb.mVertexId) ? cross_count + 1 : cross_count)
//<< std::endl;
q.push({nb.mVertexId, new_dist});
// IsNode(nb.mVertexId) ? cross_count + 1 : cross_count});
// q.push({nb.mVertexId, IsNode(nb.mVertexId) ? cross_count + 1 :
// cross_count});
}
break;
case SEARCH_STATE::OPEN:
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment