Return to Blerina Sinaimeri


Description of the course

The course provides an introduction to basic algorithms on graphs. It covers graph traversals (BFS and DFS), greedy algorithms to find MST (Kruskal’s algorithm and Prim’s algorithm) and introduction on approximation algorithms.

Lecture notes

  • Notes for Lecture I pdf

Exercises to practice

  • Some exercises to practice can be found here
  • Textbooks

    • Introduction to algorithms, Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein
      MIT Press, 2001 – 1180 Seiten.

    Permanent link to this article: