Prim's algorithm
Loading...
Link to this comment:
Uploader Comments (bodil)
All Comments (20)
-
dick head#
-
@bodil yupp sure does Thank you!!! :D
-
@1258585 7 or in that case F is not in the tree so you can not make a connection EF becouse F is not in the tree, the smallest one that is connected to the tree is 12, so it's BE
-
The circled ones at the top, are ones that were added to the tree. After adding it cross it's row. So when you look at a row horizontally you need to chose the smallest value that is in the column of the circled ones...easy
4 months ago 2
-
@1258585 isn't 7 the smallest weight in row E?! how is it 12?
-
I dont understand this AT ALL! >(
-
@Johannady They were both already connected in, so that would have made a cycle.
- 4:01Dijkstra's Algorithm exampleby bactac15,259 views
- 3:19Prim's Algorithmby andrewhickson66623,312 views
- 3:46Bellman-Fordby AlgorithmsAnimations25,891 views
- 2:13Tahiti 3D La vague Ultime - IMAX Quebecby ImaxQuebec21,082 views
- 4:25kruskalby edu222624,754 views
- 0:36Kruskalby AlgorithmsAnimations2,817 views
- 15:30D1 critical path analysisby tallistube9,653 views
- 0:39Prim vs. Kruskalby tdamdouni1,928 views
- 6:46Prim's Algorithm: Minimal Spanning Treeby profbbrown7,354 views
- 2:48prim 02by udimamoreno2,608 views
- 58:30Lec-24 Traveling Salesman Problem(TSP)by nptelhrd46,024 views
- 1:29kruskalby videosinformacionweb6,531 views
- 4:52Prim's Algorithm for a Networkby bartondeb1601 views
- 2:56Visualization of Quick sortby udiprod239,667 views
- 7:29Postmanby GreenfordMaths4,861 views
- 3:33алгоритм Прима-Краскалаby bassangova300920085,134 views
- 9:28Dijkstra's Algorithm: Shortest Pathby profbbrown17,791 views
- 1:48Prim Graphby GreenfordMaths14,823 views
- 4:11Prim's Algorithm - Matrixby bartondeb1508 views
- 9:09Prim's Algorithm, Minimum Spanning Tree (Lec 12...by amrinderarora1,876 views
At the bottom where you have drawn the minimun spanning tree, Can you draw that in any way you want? This is the bit i am struggling with, When you get a question which says from the matrix use prims and draw the tree? does the tree have to draw in any specific way? Thanks!
lktutzi 3 months ago
@lktutzi You need to connect the new node to the node it came from, so basically connect it to the column letter when you cross it off. E.g. at 0:27 when you cross off D, it's because you've chosen weight 9 from column C. So draw D coming off C in the tree. Draw it as you go, not all at the end. Hope that makes sense :D
bodil 3 months ago