typedef adjacency_list<listS, listS, undirectedS, node_t> 
connectivity_graph_t;
connectivity_graph_t g;
connectivity_graph_t::vertex_descriptor self;
self = add_vertex(g);
// ...
// code that adds more vertexes and edges
// ...
vector<int> distances(num_vertices(g));
dijkstra_shortest_paths(g, self, distance_map(&distances[0])); // this is 
line 89