copy_graph - 的adjacency_list捆绑性质

问题描述

下面是一个完整的片段，以图复制捆绑性质，但在一堆编译器错误的结果。现在需要解决的问题？

 结构NodeInfo1 {};
结构EdgeInfo1 {};TYPEDEF提振:: labeled_graph＆LT;提高::的adjacency_list＆LT;
    促进血管内皮细胞::，促进血管内皮细胞::，提振:: undirectedS，NodeInfo1，EdgeInfo1＆gt;中
    标准::字符串＆GT; Graph1;的typedef的std ::对＆LT;提高:: graph_traits＆LT;＆图表GT; :: edge_descriptor的，布尔＆GT;边缘;
无效的TestCase :: TestCopyGraph（）
{
    Graph1格，G1;
    EdgeInfo1 EI;    边e = add_edge_by_label（A，B，EI，网格）;
    copy_graph（网格，G1）;
}
 

解决方案

这是稍微misre presenting的问题。你不是的真正的复制邻接表，你复制labeled_graph适配器，这恰好不是满足 copy_graph 所需的概念：

Here's copying the adjacency_list: ¹

typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, NodeInfo1, EdgeInfo1> AList;
typedef boost::labeled_graph<AList, std::string> Graph;

void TestCopyGraph()
{
    std::string names[3] = { "A", "B", "C" };
    Graph grid(3, names);
    EdgeInfo1 ei;

    /*auto e =*/ add_edge_by_label("C", "B", ei, grid);

    AList g1;
    copy_graph(grid, g1);
}

Copying the Labeled adaptor

Is much easier. No copy_graph required, just copy-construct the object:

#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/copy.hpp>
#include <boost/graph/labeled_graph.hpp>
#include <boost/graph/graph_utility.hpp>

struct NodeInfo1 { int i; };
struct EdgeInfo1 { int j; };

typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, NodeInfo1, EdgeInfo1> AList;
typedef boost::labeled_graph<AList, std::string> Graph;

auto TestCopyGraph()
{
    std::string names[3] = { "A", "B", "C" };
      NodeInfo1 props[3] = { {11}, {22}, {33} };
    Graph grid(3, names, props);
    /*auto e =*/ add_edge_by_label("C", "B", EdgeInfo1{17}, grid);

    Graph g1 = grid; // just copy-construct
    return g1;
}

int main() {
    auto copied = TestCopyGraph();

    print_graph(copied);

    // check that properties were copied: vertex B has NodeInfo1 22
    {
        auto pmap = boost::get(&NodeInfo1::i, copied);
        std::cout << "Vertex B NodeInfo1.i after copy: " << pmap[copied.vertex("B")] << "\n";
    }

    // edge properties too:
    for (auto e : boost::make_iterator_range(edges(copied)))
        std::cout << "Edge has property EdgeInfo1 " << copied[e].j << "\n";

    std::cout << "Removed A:\n";
    copied.remove_vertex("A");
    print_graph(copied);
}

Prints

0 <-->
1 <--> 2
2 <--> 1
Vertex B NodeInfo1.i after copy: 22
Edge has property EdgeInfo1 17
Removed A:
0 <--> 1
1 <--> 0

¹ Note that you need this patch because of bugs in labeled_graph: https://github.com/boostorg/graph/pull/58

这篇关于copy_graph - 的adjacency_list捆绑性质的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！