ypename Graph, typename VertexIndexMap, typename AddEdgeVisitor&gt;
make_connected(Graph& g, VertexIndexMap vm, AddEdgeVisitor& vis);
</pre>

<p>

A undirected graph <i>G</i> is connected if, for every pair of vertices
<i>u,v</i> in <i>G</i>, there is a path from <i>u</i> to <i>v</i>.
<tt>make_connected</tt> adds the minimum number of edges needed to make the
input graph connected. The algorithm first identifies all of the
<a href="./connected_components.html">connected components</a> in the graph,
then add