Скачать с ютуб Minimum Spanning Trees with Prim's and Kruskal's Algorithms в хорошем качестве

Minimum Spanning Trees with Prim's and Kruskal's Algorithms

A complete graph with three or more nodes is full of cycles allowing multiple paths or walks between nodes or vertices. When a weight is added to each edge of a walk, we can determine the optimal walk. This has applications ranging from networking to travel planning. After defining spanning trees, weighted graphs, and minimum spanning trees, we present the Prim and Kruskal algorithms, two tools we can use to determine the minimum spanning tree from a connected graph. Timestamps 00:00 | Intro 00:16 | Tree review 01:27 | Spanning tree description 02:40 | Spanning trees from complete graphs 04:56 | Ethernet "Time to Live" element 06:04 | Weighted graph description 09:15 | What could the weights represent? 10:13 | Minimum spanning tree description 11:53 | Presenting a complete graph example - airline connections 13:28 | Prim's algorithm description 15:24 | Prim's algorithm example 18:06 | Kruskal's algorithm description 19:44 | Kruskal's algorithm example Hashtags #tree #prim #kruskal