Can you demonstrate how you would implement Dijkstra's Shortest Path in the programming language you normally work with?

"Dijkstra's algorithm is used for finding the shortest path between nodes with positive-edge weights in a graph. Sometimes it is also used to find the shortest path from a single node to a single destination. This is accomplished by stopping the algorithm once the shortest path has been determined. It is widely used in applications which involve artificial intelligence and calculations to determine the efficiency of an operation."

The interviewer will ask you this question because the organization likely utilizes this methodology in its current programming processes. He will make sure that you are familiar with this and can immediately begin implementing it if hired. You will likely be asked about several processes, methodologies, and practices the organization uses. Companies prefer to hire employees who can quickly integrate themselves into the organization and become productive as soon as possible.