C++ 使用Boost向图形添加顶点和边

我是boost库的新手，有几个问题。从下面的代码中，我只是在尝试Dijkstra算法，它工作得很好

我想从函数param.vertices and edges的参数中的向量中输入我自己的一组顶点和边。我该怎么做呢

void blossom2(vector<Node*>&vertices, vector<Node*> &clients, vector<Edge*> &edges){
typedef boost::property<boost::edge_weight_t, float> EdgeWeightProperty;

typedef boost::adjacency_list < boost::listS, boost::vecS, boost::undirectedS,
    boost::no_property, EdgeWeightProperty > Graph;

typedef boost::graph_traits < Graph >::vertex_descriptor vertex_descriptor;
typedef boost::graph_traits < Graph >::edge_descriptor edge_descriptor;
typedef std::pair<int, int> Edge;

// Create a graph
Graph g;

Graph::vertex_descriptor v0 = boost::add_vertex(g);
Graph::vertex_descriptor v1 = boost::add_vertex(g);
Graph::vertex_descriptor v2 = boost::add_vertex(g);

// Add weighted edges
EdgeWeightProperty weight0(5);
boost::add_edge(v0, v1, weight0, g);

EdgeWeightProperty weight1 = 3;
boost::add_edge(v1, v2, weight1, g);

EdgeWeightProperty weight2 = 2;
boost::add_edge(v2, v0, weight2, g);

// Create things for Dijkstra
std::vector<vertex_descriptor> parents(boost::num_vertices(g)); // To store parents
std::vector<int> distances(boost::num_vertices(g)); // To store distances

// Compute shortest paths from v0 to all vertices, and store the output in parents and distances
boost::dijkstra_shortest_paths(g, v0, boost::predecessor_map(&parents[0]).distance_map(&distances[0]));

// Output results
std::cout << "distances and parents:" << std::endl;
boost::graph_traits < Graph >::vertex_iterator vertexIterator, vend;
for (boost::tie(vertexIterator, vend) = boost::vertices(g); vertexIterator != vend; ++vertexIterator)
{
    std::cout << "distance(" << *vertexIterator << ") = " << distances[*vertexIterator] << ", ";
    std::cout << "parent(" << *vertexIterator << ") = " << parents[*vertexIterator] << std::endl;
}
std::cout << std::endl;

---

}

调用“添加顶点”和“添加边”函数。问题是什么？你只显示了代码/正在工作/那么我们怎么才能神奇地想象出你希望发生的事情？