some potential applications for MST construction. These are something you should look into in more detail on your own time. You might also consider looking into at least one of the algorithms that I mentioned for constructing MSTs: Prim's algorithm or Kruskal's algorithm. You never know when having one of those in your back pocket might help you solve an interview problem.</p>
<p><br /><strong>Topological Sort</strong></p>
<p>We also talked briefly about topological sort, its relationship to dependency grap