c++ - Boost图分割错误

Question

我正在尝试使用 Boost 通过 Chrobak-Payne 算法嵌入平面图。我能够运行 example成功，但是当我尝试修改它并使用不同的图形时，它无法正常工作。我正在尝试嵌入 second platonic graph但它不起作用，我的代码因“段错误:11”而崩溃。我认为这是因为我需要使用 make_connected、make_biconnected_planar 和 make_maximal_planar，但添加它们并没有解决问题。

这是使用第二个柏拉图图和三个辅助函数修改后的源代码示例:

//=======================================================================
// Copyright 2007 Aaron Windsor
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#include <iostream>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/property_map/property_map.hpp>
#include <vector>

#include <boost/graph/planar_canonical_ordering.hpp>
#include <boost/graph/is_straight_line_drawing.hpp>
#include <boost/graph/chrobak_payne_drawing.hpp>
#include <boost/graph/boyer_myrvold_planar_test.hpp>



using namespace boost;

//a class to hold the coordinates of the straight line embedding
struct coord_t
{
  std::size_t x;
  std::size_t y;
};


int main(int argc, char** argv)
{
typedef adjacency_list
    < vecS,
      vecS,
      undirectedS,
      property<vertex_index_t, int>,
      property<edge_index_t, int>
    > 
    graph;

  graph g(7);
  add_edge(0,1,g);
  add_edge(1,2,g);
  add_edge(2,3,g);
  add_edge(3,0,g);
  add_edge(0,4,g);
  add_edge(1,5,g);
  add_edge(2,6,g);
  add_edge(3,7,g);
  add_edge(4,5,g);
  add_edge(5,6,g);
  add_edge(6,7,g);
  add_edge(7,4,g);

  make_connected(g); //Make connected (1/3)

  //Compute the planar embedding as a side-effect
  typedef std::vector< graph_traits<graph>::edge_descriptor > vec_t;
  std::vector<vec_t> embedding(num_vertices(g));
  boyer_myrvold_planarity_test(boyer_myrvold_params::graph = g,
                                   boyer_myrvold_params::embedding = 
                                     &embedding[0]
                                   );


  make_biconnected_planar(g, &embedding[0]); //Make biconnected planar (2/3)

  make_maximal_planar(g, &embedding[0]); //Make maximal planar (3/3)

  //Find a canonical ordering
  std::vector<graph_traits<graph>::vertex_descriptor> ordering;
  planar_canonical_ordering(g, &embedding[0], std::back_inserter(ordering));

  //Set up a property map to hold the mapping from vertices to coord_t's
  typedef std::vector< coord_t > straight_line_drawing_storage_t;
  typedef boost::iterator_property_map
    < straight_line_drawing_storage_t::iterator, 
      property_map<graph, vertex_index_t>::type 
    >
    straight_line_drawing_t;

  straight_line_drawing_storage_t straight_line_drawing_storage
    (num_vertices(g));
  straight_line_drawing_t straight_line_drawing
    (straight_line_drawing_storage.begin(), 
     get(vertex_index,g)
     );

  // Compute the straight line drawing
  chrobak_payne_straight_line_drawing(g, 
                                      embedding, 
                                      ordering.begin(),
                                      ordering.end(),
                                      straight_line_drawing
                                      );



  std::cout << "The straight line drawing is: " << std::endl;
  graph_traits<graph>::vertex_iterator vi, vi_end;
  for(boost::tie(vi,vi_end) = vertices(g); vi != vi_end; ++vi)
    {
      coord_t coord(get(straight_line_drawing,*vi));
      std::cout << *vi << " -> (" << coord.x << ", " << coord.y << ")" 
                << std::endl;
    }

  // Verify that the drawing is actually a plane drawing
  if (is_straight_line_drawing(g, straight_line_drawing))
    std::cout << "Is a plane drawing." << std::endl;
  else
    std::cout << "Is not a plane drawing." << std::endl;

  return 0;
}

但出于某种原因，我仍然遇到段错误。我知道它在通话中:

chrobak_payne_straight_line_drawing(g, 
                                  embedding, 
                                  ordering.begin(),
                                  ordering.end(),
                                  straight_line_drawing
                                  );

因为没有它它运行良好(但不计算嵌入)。导致此段错误的内存问题在哪里？我嵌入的图表比示例小。

Answer 1

来自 must be a maximal planar graph with at least 3 vertices ，成功需要 k > 2 的要求。您调用Planar Canonical Ordering返回两个顶点。 Catch is chrobak_payne_straight_line_drawing 不检查你，它在 std 中的 vector 迭代器测试中断言。

添加:

assert( ordering.size( ) > 2 );

在调用之前，或有条件的，取决于你在做什么。

还有一个优势:

add_edge(1,4,g);

它会奏效。