title: Why can't Prim's or Kruskal's algorithms be used on a directed graph?
body: <p>Prim's and Kruskal's algorithms are used to find the minimum spanning tree of a graph that is connected and undirected. Why can't they be used on a graph that is directed?</p>