Is routing easy or hard ?

Case A

1) Assume each link has

equal weight. Is routing easy ?

2) What if there were a

non-negligible probability

of links going down ?

Case B

If the numbers above refer to

link weights, what is the path

(sequence of links) from h to d

which has the minimum total

weight (shortest path) ?