Minimum Spanning Trees I - MIT OpenCourseWare
https://ocw.mit.edu/courses/6-046j-design-and-analysis-of-algorithms-spring-2012/6baf48ebe3babed294c31a907a916e08_MIT6_046JS12_lec03.pdf
web3.3 Minimum Spanning Trees. Given a weighted undirected graph G Æ (V,E,w), one often wants to find a minimum spanning tree (MST) of G: a spanning tree T for which the total weight w(T) Æ P(u,v)2T w(u,v) is minimal.
DA: 30 PA: 17 MOZ Rank: 75