Microsoft Certified Systems Engineer (MCSE) Question:
What is the goal of the shortest distance algorithm?
Answer:
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.
| Previous Question | Next Question |
| What is the null pointer in C++? | What is the difference between an abstract class and an interface? |