Edge Value Assignment

Visit DAG vertices

bottom-up(topological order)

Number ofpaths to EXIT

Edge value

w1

w2

w3

n1

n2

n3

0

n1

n1+n2

n1+n2+n3

v

Previous slide

Next slide

Back to first slide

View graphic version