boost中顶点的问题：：子图

Question

The issue

文章底部的代码打印出来：

Vertices in g  = [ 0 1 2 3 4 ]
Vertices in g' = [ 0 1 ]

我的预期产出是：

Vertices in g  = [ 0 1 2 3 4 ]
Vertices in g' = [ 3 4 ]

这是boost：：子图中的一个bug，还是在我对库的理解中？

问题中的代码

#include <sstream>
#include <iostream>

#include <boost/graph/subgraph.hpp>
#include <boost/graph/adjacency_list.hpp>

using namespace std;
using namespace boost;

// Underlying graph representation and implementation
typedef adjacency_list_traits<vecS, vecS, directedS> Traits;

// Graph representation
typedef subgraph< adjacency_list<vecS, vecS, directedS,
    property<vertex_color_t, int>, property<edge_index_t, int> > > Graph;

// Iterating over vertices and edges
typedef graph_traits<Graph>::vertex_iterator vertex_iter;
typedef graph_traits<Graph>::edge_iterator edge_iter;

int main(void)
{
    Graph g;
    add_edge(0,1, g);
    add_edge(1,2, g);
    add_edge(3,4, g);

    Graph sub = g.create_subgraph();
    add_vertex(3, sub);
    add_vertex(4, sub);

    pair<vertex_iter, vertex_iter> vip;

    cout << "Vertices in g  = [ ";
    vip = vertices(g);
    for(vertex_iter vi = vip.first; vi != vip.second; ++vi) {
        cout << *vi << " ";
    }
    cout << "]" << endl;

    cout << "Vertices in g' = [ ";
    vip = vertices(sub);
    for(vertex_iter vi = vip.first; vi != vip.second; ++vi) {
        cout << *vi << " ";
    }
    cout << "]" << endl;

    return 0;
}

Answer 1

我太懒了，看不懂文件。boost:区分“本地”和“全局”描述符的子图。

add_vertex函数在向子图添加顶点时使用全局描述符。函数返回本地描述符。

我需要做的是使用子图上的local_to_global()方法将本地描述符“解析”为我所期望的全局描述符。

产出：

Vertices in g  = [ 0 1 2 3 4 ]
Vertices (local) in g' = [ 0 1 ]
Vertices (global) in g' = [ 3 4 ]

来自于代码：

#include <sstream>
#include <iostream>

#include <boost/graph/subgraph.hpp>
#include <boost/graph/adjacency_list.hpp>

using namespace std;
using namespace boost;

// Underlying graph representation and implementation
typedef adjacency_list_traits<vecS, vecS, directedS> Traits;

// Graph representation
typedef subgraph< adjacency_list<vecS, vecS, directedS,
    property<vertex_color_t, int>, property<edge_index_t, int> > > Graph;

// Iterating over vertices and edges
typedef graph_traits<Graph>::vertex_iterator vertex_iter;
typedef graph_traits<Graph>::edge_iterator edge_iter;

int main(void)
{
    Graph g;
    add_edge(0,1, g);
    add_edge(1,2, g);
    add_edge(3,4, g);

    Graph sub = g.create_subgraph();
    add_vertex(3, sub);
    add_vertex(4, sub);

    pair<vertex_iter, vertex_iter> vip;

    cout << "Vertices in g  = [ ";
    vip = vertices(g);
    for(vertex_iter vi = vip.first; vi != vip.second; ++vi) {
        cout << *vi << " ";
    }
    cout << "]" << endl;

    cout << "Vertices (local) in g' = [ ";
    vip = vertices(sub);
    for(vertex_iter vi = vip.first; vi != vip.second; ++vi) {
        cout << *vi << " ";
    }
    cout << "]" << endl;

    cout << "Vertices (global) in g' = [ ";
    vip = vertices(sub);
    for(vertex_iter vi = vip.first; vi != vip.second; ++vi) {
        cout << sub.local_to_global(*vi) << " ";
    }
    cout << "]" << endl;

    return 0;
}