在沒有圖形的情況下創建邊描述符

Question

在我的項目中，我使用一個存儲所有邊的文件;另一個存儲邊緣概率。我想使用Boost圖庫和unordered_map作爲概率。我有以下代碼。

typedef boost::adjacency_list <boost::vecS, boost::vecS, boost::bidirectionalS> DiGraph; 
typedef boost::graph_traits<SubGraph>::vertex_descriptor vertex_t; 
typedef boost::graph_traits<SubGraph>::edge_descriptor edge_t; 

unordered_map<edge_t, double> P; 

ifstream infile(prob_filename); 
double p; 
int u, v; 
while (infile >> u >> v >> p) { 
    P[make_pair(u, v)] = p; 
} 

不過，我並不需要做一對作爲重點，而是一個邊描述符edge_t。我如何創建給定兩個值的邊描述符u和v。

Answer 1

From boost graph concepts

DirectedGraph digraph(V); 
    { 
    boost::graph_traits<DirectedGraph>::vertex_descriptor u, v; 
    u = vertex(0, digraph); // read these instead 0,1 from from your file 
    v = vertex(1, digraph); 
    // populate graph 
    add_edge(digraph, u, v, Weight(1.2)); // read weight (prob) instead from from your file 

    boost::graph_traits<DirectedGraph>::edge_descriptor e; 
    bool found; 
    boost::tie(e, found) = edge(u, v, digraph); 

    //use property map 
    property_map<DirectedGraph, edge_weight_t>::type 
     weight = get(edge_weight, digraph); 

    cout << "weight[(u,v)] = " << get(weight, e) << endl; 

    }