1. The all-pairs shortest-path problem involves finding the shortest path a. from the starting vertex to every other vertex. b. from every vertex to every other vertex. c. from the starting vertex to...

1.
The all-pairs shortest-path problem involves finding the shortest path

a.
from the starting vertex to every other vertex.

b.
from every vertex to every other vertex.

c.
from the starting vertex to every vertex that is one edge away.

d.
from every vertex to every other vertex that is one or more edges away.

2.
Floyd’s algorithm is to weighted graphs what _______ is to un weighted graphs.