Microsoft Certified Systems Engineer (MCSE) Question:
Download Questions PDF

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.

Download MCSE Interview Questions And Answers PDF

Previous QuestionNext Question
What is the null pointer in C++?What is the difference between an abstract class and an interface?