MCSE Interview Question:

What is the goal of the shortest distance algorithm?

Submitted by: Administrator

The goal is completely fill the distance array so that for each vertex v, the value of distance[v] is the weight of the shortest path from start to v.
Submitted by: Administrator