使用捆绑属性提升 BGL read_graphviz

Question

我有一个这样定义的图表：

struct EdgeInfoProperty{
    int score;
    //is the trans from v to u, where u<v
    Trans trans;
};
typedef boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::no_property, EdgeInfoProperty > Graph;
typedef Graph::edge_descriptor Edge;
typedef Graph::vertex_descriptor Vertex;

我使用write_graphviz 将边 + 分数写入文件（我正在单独编写 Trans，所以我只想在读取点文件时读取分数）。我是这样写的：

auto w_map = boost::get(&EdgeInfoProperty::score, G); // <=== THIS IS THE TRICK!!!
boost::write_graphviz(myfile, G, boost::default_writer(), make_edge_writer(w_map));

我的点文件看起来像：

graph G {
0;
1;
2;
3;
4;
5;
6;
7;
8;
9;
10;
11;
12;
0--1 [label="-3"];
0--5 [label="-2"];
2--3 [label="-8"];
3--8 [label="-4"];
4--5 [label="-1"];
4--6 [label="-6"];
4--7 [label="-5"];
4--8 [label="-10"];
8--9 [label="-9"];
}

所以，我基本上想加载 G，以便在 0--1 等与G[edge].score = -3 等和G[edge].trans = //some default value or whatever 之间有一个边。

我现在拥有的东西给了我大量的编译错误，我正在认真考虑只制作我的图表的纯文本副本，而不是尝试读取点文件然后从那里重新创建图表...

这是我所拥有的：

    std::string gn = loc + "MST.dot";
    Graph G(0);
    boost::dynamic_properties dp;
    boost::property_map<Graph, boost::vertex_name_t>::type name = boost::get(boost::vertex_name, G);
    dp.property("node_id",name);

    auto score = boost::get(&EdgeInfoProperty::score, G);
    dp.property("score",score);

    std::filebuf fb;
    fb.open (gn, std::ios::in);
    std::istream isg(&fb);
    bool status = boost::read_graphviz(isg,G,dp,"node_id");

我很确定只有分数是个问题，但我尝试获取 EdgeInfoProperty 地图，只是我尝试的所有操作都出错了...

Answer 1

问题

你的代码有几个错误：

boost::get(boost::vertex_name,G) 假设您的顶点中有一个名为 name 的属性，但事实并非如此。此外，read_graphviz() 将节点标识符存储到名为node_id 的属性映射中。但是在您的情况下，您的顶点没有属性。它不能工作。

运行示例

#include <iostream>
#include <sstream>

#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <boost/graph/graphviz.hpp>
#include <boost/property_map/dynamic_property_map.hpp>
using namespace std;

struct Trans {
    int t;
};

struct EdgeInfoProperty {
    int score;
    //is the trans from v to u, where u<v
    Trans trans;
};

struct NodeInfoProperty {
    int index;
};

/* you cannot read a graph without node property. By default, read_graphviz() assume
 * nodes have a "node_id" property map...
 */
typedef boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, NodeInfoProperty, EdgeInfoProperty > Graph;

template<class Index> class noeud_writer {
public:
    noeud_writer(Index id) : idm(id){}
    template<class Noeud> void operator()(std::ostream & out, const Noeud & n) {
        out << "[index=" << idm[n] << "]"; }
private:
    Index idm;
};

template< class IdMap> inline noeud_writer<IdMap> make_noeud_writer(IdMap idm) {
    return noeud_writer<IdMap>(idm); }

template<class Score> class edge_writer {
public:
    edge_writer(Score s) : score(s){}
    template<class Noeud> void operator()(std::ostream & out, const Noeud & n) {
        out << "[score=" << score[n] << "]"; }
private:
    Score score;
};

template< class Score> inline edge_writer<Score> make_edge_writer(Score score) {
    return edge_writer<Score>(score); }


int main(int argc, char * argv[])
{
    Graph G(0);
    boost::dynamic_properties dp;
    dp.property("index", boost::get(&NodeInfoProperty::index,G));

    auto score = boost::get(&EdgeInfoProperty::score, G);
    dp.property("score", score);

    std::istringstream isg("graph G {0[index=0];1[index=1];0--1[score=-3];}");
    bool status = boost::read_graphviz(isg, G, dp,"index");

    write_graphviz(std::cout, G, make_noeud_writer(boost::get(&NodeInfoProperty::index, G)),
                                  make_edge_writer(boost::get(&EdgeInfoProperty::score, G)));
    return 0;
}