7,974 views
This video discusses Prim's algorithm for the minimum spanning tree problem by applying it to a small example. It covers: Spanning tree: one of the many characterizations of a tree (useful for Prim) Co-cycle: an important concept for quite a few algorithms: Prim, Kruskal, and Djikstra Prim's and Kruskal's algorithms are both greedy algorithms.