graph.h"<br />using namespace std;<br /><br /><strong>int</strong> main()<br />{<br />   <strong>BasicGraph</strong> g;<br /><br />   g.addNode("u");<br />   g.addNode("v");<br />   g.addNode("w");<br /><br />   g.addEdge("u", "v");<br />   g.addEdge("v", "u");<br /><br />   g.addEdge("v", "w");<br />   g.addEdge("w", "v");<br /><br />   ...<br /><br />   <strong>return</strong> 0;<br />}</pre>
<p><strong><br />Minimum Spanning Trees</strong></p>
<p>We talked briefly about minimum spanning trees (MSTs) and 