Thinkycap logo
Worksheets

Minimum Spanning Trees and Shortest Paths

Bachelor of Science in Computer Science · University · Data Structures and Algorithms

This unit delves into the fundamentals of finding minimum spanning trees and shortest paths in graphs. Students will master algorithms like Kruskal's, Prim's, Dijkstra's, and Floyd-Warshall, gaining a deep understanding of their applications in real-world scenarios.

Coming soonPractice questions for this topic are coming soonUntil then, you can already practice other topics.Browse topics

What's included

  • Minimum Spanning Trees
  • Kruskal's Algorithm
  • Prim's Algorithm
  • Shortest Paths
  • Dijkstra's Algorithm
  • Floyd-Warshall Algorithm
  • Applications of Minimum Spanning Trees and Shortest Paths

Keywords

  • Graphs
  • Data Structures
  • Algorithms