@@ -355,8 +355,8 @@ void GraphPlanar::Write() {
355355 // Create the planar embedding
356356 auto embedding_storage = EdgePermutationStorage (num_vertices);
357357 auto embedding = EdgePermutation (embedding_storage.begin (), vertex_index);
358- const bool is_planar = PlanarEmbedding (graph, embedding_storage, embedding);
359- if (!is_planar ) {
358+ const bool is_planar_1 = PlanarEmbedding (graph, embedding_storage, embedding);
359+ if (!is_planar_1 ) {
360360 output_ = " Graph is not planar.\n " ;
361361 return ;
362362 }
@@ -367,6 +367,7 @@ void GraphPlanar::Write() {
367367 graph, embedding, boost::get (boost::edge_index, graph), edge_updater);
368368 const bool is_planar_2 = PlanarEmbedding (graph, embedding_storage, embedding);
369369 assert (is_planar_2);
370+ std::ignore = is_planar_2;
370371
371372 // After executing `make_maximal_planar` edges are added to the graph, so
372373 // we must update the indexes and the embedding.
@@ -375,6 +376,7 @@ void GraphPlanar::Write() {
375376 edge_updater);
376377 const bool is_planar_3 = PlanarEmbedding (graph, embedding_storage, embedding);
377378 assert (is_planar_3);
379+ std::ignore = is_planar_3;
378380
379381 // Find a canonical ordering.
380382 std::vector<size_t > ordering;
0 commit comments