从一个特定的起始顶点提升prim_minimum_spanning_tree

对于一个简单的图，直接调用prim_minimum_spanning_tree来获得从顶点0开始的结果:

#include <iostream>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/prim_minimum_spanning_tree.hpp>
typedef boost::property<boost::edge_weight_t, double> EdgeWeightProperty;
typedef boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, boost::no_property, EdgeWeightProperty> Graph;
int main(int,char*[])
{
    // Create a graph object
    Graph g(3);
    EdgeWeightProperty e1 = 5;
    add_edge(0, 1, e1, g);
    EdgeWeightProperty e2 = 3;
    add_edge(1, 2, e2, g);
    std::vector < boost::graph_traits < Graph >::vertex_descriptor > parents(num_vertices(g));
    prim_minimum_spanning_tree(g, &parents[0]);
    for (std::size_t i = 0; i != parents.size(); ++i) {
      if (parents[i] != i) {
        std::cout << "parent[" << i << "] = " << parents[i] << std::endl;
      }
      else {
        std::cout << "parent[" << i << "] = no parent" << std::endl;
      }
    }

    return 0;
}

但是我似乎无法解密指定不同起始顶点的签名?看起来这是唯一一个需要一个vertex_descriptor(我假设是开始顶点?):

  prim_minimum_spanning_tree
    (const VertexListGraph& g,
     typename graph_traits<VertexListGraph>::vertex_descriptor s, 
     PredecessorMap predecessor, DistanceMap distance, WeightMap weight, 
     IndexMap index_map,
     DijkstraVisitor vis)

有什么建议吗?