Graphs II

View slides in full screen

Warning

The previous slides are provided as a reminder of the material seen in class. They are intended to be complemented with the vocal part and the blackboard, therefore they are not in any way a substitute of a book, nor some lecture notes. Please use the books provided in the references for the self-study.

Jutge exercises

The exercises that can be thought as variations on Breadth-First Search (BFS) are the following:

• P60796 Treasures in a map (2)
• P39846 Treasures in a map (4)
• P88760 Zamburguesas

The Jutge exercises that can be thought as variations on Dijkstra’s algorithm are the following:

• P43859 Weighted shortest path (1) 🔶
• P13994 Weighted shortest path (2)
• P25235 Weighted shortest path (3)
• P39586 Weighted shortest path (4)

The Jutge exercises that can be thought as variations on Jarník-Prim’s algorithm are the following:

• P12887 Minimum spanning trees

Important

If you have doubts while solving the above exercises please write me an email as soon as possible (and/or write an email to your instructor of the problem class).