1. Making Change
Coins: 2 and 3 3 4 5 1 2 1

2. Reachability on graph w. cycles3 4 5 1 2 2

3. Reachability algorithm 3 4 5 1 2 
Reachable from 0 3

4. Reachability algorithm  3 4 5 1 2 
Reachable from 0 4

5. Reachability algorithm   3 4 5 1 2 
Reachable from 0 5

6. Reachability algorithm    3 4 5 1 2 
Reachable from 0 6

7. Reachability algorithm     3 4 5 1 2 
Reachable from 0 7

8.      3 4 5 1 2  Reachability algorithm: second pass1 2 
Reachable from 0 8

9. Comment cards 9

10. Shortest Path 1 1 1 3 4 5 1 2 -1 1 -2 10

11. Shortest Path 1 1 1 3 4 5 1 2 -1 1 -2 11

12. Shortest Path
dist: ∞ ∞ ∞ ∞ ∞ 1 1 1 3 4 5 1 2 -1 1 -2 12

13. Shortest Path
dist: ∞ 1 ∞ ∞ ∞ 1 1 1 3 4 5 1 2 -1 1 -2 13

14. Shortest Path
dist: ∞ 1 ∞ 2 ∞ 1 1 1 3 4 5 1 2 -1 1 -2 14

15. Shortest Path
dist: ∞ 1 ∞ 2 3 1 1 1 3 4 5 1 2 -1 1 -2 15

16. Shortest Path
dist: 1 1 ∞ 2 3 1 1 1 3 4 5 1 2 -1 1 -2 16

17. Shortest Path
dist: 1 1 2 2 3 1 1 1 3 4 5 1 2 -1 1 -2 17

18. Shortest Path
dist: 1 1 2 1 3 1 1 1 3 4 5 1 2 -1 1 -2 18

19. Shortest Path
dist: 1 1 2 1 2 1 1 1 3 4 5 1 2 -1 1 -2 19

20. Shortest Path
dist: 1 2 1 2 1 1 1 3 4 5 1 2 -1 1 -2 20

21. Shortest Path
dist: 1 1 1 2 1 1 1 3 4 5 1 2 -1 1 -2 21

22. Shortest Path
dist: 1 1 2 1 1 1 3 4 5 1 2 -1 1 -2 22

23. Shortest Path
dist: 1 1 1 1 1 1 3 4 5 1 2 -1 1 -2 23

24. Shortest Path
dist: -1 1 1 1 1 1 1 3 4 5 1 2 -1 1 -2 24

25. Negative Cycle 1 1 1 3 4 5 1 2 -1 1 -2 25

26. Comment cards 26