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

Reachability on graph w. cycles 3 4 5 1 2 2

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

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

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

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

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

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

Comment cards https://goo.gl/RKd8vq 9

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Comment cards https://goo.gl/RKd8vq 26