bugl
bugl
HomeLearnPatternsSearch
HomeLearnPatternsSearch
Learn/DSA

DSA

Minimum Spanning Tree

Minimum Spanning Tree focused on DSA Minimum Spanning Tree and related concepts.

Lesson 1visual

DSA Minimum Spanning Tree

DSA Minimum Spanning Tree

2 min
Read lesson →
Lesson 2visual

DSA Prim's Algorithm

Prim's algorithm was invented in 1930 by the Czech mathematician Vojtěch Jarník. The algorithm was then rediscovered by Robert C. Prim in 1957, and also rediscovered by Edsger W. Dijkstra in 1959. Th…

11 min
Read lesson →
Lesson 3visual

DSA Kruskal's Algorithm

Kruskal's Algorithm Kruskal's algorithm finds the Minimum Spanning Tree (MST), or Minimum Spanning Forest, in an undirected graph. Connected The MST (or MSTs) found by Kruskal's algorithm is the coll…

9 min
Read lesson →