x_pair</tt> to dispatch
its calls to <tt>add_edge</tt>.
</blockquote>



<h3>Complexity</h3>

On a graph with <i>n</i> vertices and <i>m</i> edges, <tt>make_connected</tt>
runs in time <i>O(n + m)</i>

<H3>Example</H3>

<P>
<a href="../example/make_connected.cpp">
<TT>../example/make_connected.cpp</TT>
</a>

<h3>See Also</h3>

<a href="planar_graphs.html">Planar Graphs in the Boost Graph Library</a>

<br>
<HR>
Copyright &copy; 2007 Aaron Windsor (<a href="mailto:aaron.windsor@gmail.com">
aaron.windsor@gmail