0

我正在努力实现一个简单的 boost::graph。我试图阅读我能找到的所有文档和示例等......

这是我的代码（从 StackOverflow 上的其他示例中复制）

顶点：

class customvertex
{
public:
    double some_member;
};

访客：

class MyVisitor : public boost::default_dfs_visitor
{
public:
    void discover_vertex(MyGraphVertex v, const MyGraph& g) const
    {
        std::cout << v << std::endl;
        return;
    }
};

typedef 声明：

typedef boost::adjacency_list<boost::vecS,boost::vecS,boost::undirectedS, customvertex> MyGraph;
typedef boost::graph_traits<MyGraph>::vertex_descriptor MyGraphVertex;

导致问题的代码：

MyGraph theGraph;
customvertex a;
MyGraphVertex vert_a = boost::add_vertex(a, theGraph);

customvertex b;
MyGraphVertex vert_b = boost::add_vertex(b, theGraph);

boost::add_edge(vert_a , vert_b, theGraph);

MyVisitor vis;
boost::depth_first_search(theGraph, boost::visitor(MyVisitor()));

对 depth_first_search 的最终调用导致编译器抛出 112 行级联错误。
这些概念似乎是 IncidenceGraphConcept 和 MultiPassInputIterator

关键部分似乎是：

1>        T:\boost\boost_1_47_0\boost/concept/detail/msvc.hpp(23) : while compiling class template member function 'void boost::concepts::check<Model>::failed(Model *)'
1>        with
1>        [
1>            Model=boost::SignedInteger<int>
1>        ]

1>        T:\boost\boost_1_47_0\boost/graph/depth_first_search.hpp(83) : see reference to function template instantiation 'void boost::function_requires<boost::concepts::IncidenceGraphConcept<G>>(Model *)' being compiled
1>        with
1>        [
1>            G=MyGraph,
1>            Model=boost::concepts::IncidenceGraphConcept<MyGraph>
1>        ]
1>        T:\boost\boost_1_47_0\boost/graph/depth_first_search.hpp(202) : see reference to function template instantiation 'void boost::detail::depth_first_visit_impl<VertexListGraph,DFSVisitor,ColorMap,boost::detail::nontruth2>(const IncidenceGraph &,unsigned int,DFSVisitor &,ColorMap,TerminatorFunc)' being compiled
1>        with
1>        [
1>            VertexListGraph=MyGraph,
1>            DFSVisitor=const MyVisitor,
1>            ColorMap=boost::shared_array_property_map<boost::default_color_type,boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_bundle_t,customvertex>,unsigned int>>,
1>            IncidenceGraph=MyGraph,
1>            TerminatorFunc=boost::detail::nontruth2
1>        ]

非常感谢任何和所有帮助。我确定我遗漏了一些简单的东西，我通常可以从示例中弄清楚。我认为 boost::graph 看起来很棒，非常适合我的需要，但需要更多文档......

我在模板编程方面相当有经验，但我现在在这方面花了太多时间，是时候寻求帮助了！

4

1 回答 1

0

从这个 GitHub，我复制了一个类似的工作（和测试）示例：

#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graphviz.hpp>
#include <boost/graph/visitors.hpp>
#include <boost/graph/depth_first_search.hpp>

struct Node
{
  Node(const int t = 0) : m_t{t} {}
  int m_t;
};

/// A phylogeny is a graph of Node of different generations
/// connected by ancestry
using phylogeny = boost::adjacency_list<
  boost::vecS,
  boost::vecS,
  boost::undirectedS,
  Node
>;

using phylogeny_vd = boost::graph_traits<phylogeny>::vertex_descriptor;

class my_visitor : public boost::default_dfs_visitor
{
public:
  void discover_vertex(phylogeny_vd vd, const phylogeny& g) const
  {
    std::cout << g[vd].m_t << std::endl;
  }
};

//Create a phylogeny
//
//        b---c---d
//        |
//    a---+
//        |
//        e---f---g
//
// ---+---+---+---+---
//    0   1   2   3  t (generation)
phylogeny create_phylogeny()
{
  phylogeny p;
  const auto a = boost::add_vertex(Node(0), p);
  const auto b = boost::add_vertex(Node(1), p);
  const auto c = boost::add_vertex(Node(2), p);
  const auto d = boost::add_vertex(Node(3), p);
  const auto e = boost::add_vertex(Node(1), p);
  const auto f = boost::add_vertex(Node(2), p);
  const auto g = boost::add_vertex(Node(3), p);
  boost::add_edge(a, b, p);
  boost::add_edge(b, c, p);
  boost::add_edge(c, d, p);
  boost::add_edge(a, e, p);
  boost::add_edge(f, g, p);
  return p;
}

int main()
{
  const phylogeny p = create_phylogeny();
  my_visitor v;
  boost::depth_first_search(
    p,
    boost::visitor(v)
  );
}
于 2017-03-21T12:07:26.257 回答