Algorithm Execution

C

B

f

X

Y

W

0

.05

.1

1

.2

0

0

1

A

.15

.20

.20

1

2

3.6

2

Z

0

O

0

0

0

Origin

1.1

2

3

Compute the longest path in a graph G = <V,E,delay,Origin> (delay is set of labels, Origin is the super-source of the DAG)

Forward-prop(W){

for each vertex v in W

for each edge <v,w> from v

Final-delay(w) = max(Final-delay(w), delay(v) + delay(w) + delay(<v,w>))

if all incoming edges of W have been traversed

add w to W

}

Longest path(G)

Forward_prop(Origin)

}

Previous slide

Next slide

Back to first slide

View graphic version