Dijkstra Part II + Minimal Spanning Trees
2Dijkstra's computes shortest paths. It does so by constantly moving nodes that are the minimal total distance from the start from the to-processed list to the processed list. In such a way it computes the minimal distance to all vertices in the graph.
Minimal Spanning Tree algorithms are identical to Disjkstra's except instead of trying to figure out the shortest distance between two points, a minimal spanning tree tries to connect all the vertices in a tree with the lowest total edge cost in the tree.
Prim's (which is one line of code different from Dijkstra's) computes the MST by starting at a node and growing a tree by adding nodes that have the smallest edge weight that aren't in the tree already. Kruskal's grows multiple trees by always selecting the smallest edge weight that won't create a cycle.
Other Videos By Bill Kerney
| 2021-10-13 | Red Herring, Non-Sequitur, Strawman, Ad Hominem, Tu Quoque |
| 2021-10-12 | Max Flow |
| 2021-10-12 | Markov Chaining (to generate Fake Alex Jones) |
| 2021-10-12 | Color, Story, Level Design |
| 2021-10-12 | Debugging; Pitch Documents; Time; Timelines to Make a Door |
| 2021-10-11 | Week 10 Day 1 - Classes Part I |
| 2021-10-11 | Fallacies Part III |
| 2021-10-08 | New/Delete, Stack vs. Heap, Old C++ vs. Modern C++ |
| 2021-10-08 | Fallacies of Composition/Division/Circular Logic |
| 2021-10-07 | Adding Skeletal Animations to UE4 |
| 2021-10-07 | Dijkstra Part II + Minimal Spanning Trees |
| 2021-10-07 | Making a 3D Engine in a Terminal |
| 2021-10-06 | Fallacies |
| 2021-10-06 | Pointers and Mapping 2D Arrays to 1D Arrays |
| 2021-10-06 | Graph Traversal + Dijkstra's Algorithm |
| 2021-10-06 | The Infamous Kitty Rocket Launcher |
| 2021-10-06 | Swimming, Delta Time, Terminator Barrel, UMG HUDs |
| 2021-10-04 | ACM Talk: Hazelton Teaches Vim |
| 2021-10-04 | Writing to Files, Error Messages in C++ (scary), and Recursion |
| 2021-10-04 | Midterm Review + Equivocation Fallacy |
| 2021-10-02 | Reading from Files in C++ |