H446 2.3 Dijkstra's Shortest Path Algorithm

What is a limitation of Dijkstra's algorithm?

• It cannot handle graphs with cycles

• It does not work with negative weight edges

• It only finds the longest path

• It cannot be used with undirected graphs

Which algorithm provided a solution for graphs with negative weights?

• Floyd-Warshall algorithm

• Kruskal's algorithm

• Bellman-Ford algorithm

• Prim's algorithm

What practical application of Dijkstra's algorithm is mentioned in the video?

• Balancing binary search trees

• Encrypting data

• Finding the shortest path in navigation systems

• Sorting algorithms

What is the initial distance set for each node in Dijkstra's algorithm?

• Infinity

• Undefined

• One

• Zero

Which data structure is used in the example to implement Dijkstra's algorithm?

• Linked list

• Queue

• Graph

• Table or array

Which node does the algorithm start with in the provided example?

• Node A

• Node B

• Node C

• Node D

What action is taken when a shorter path to a node is found?

• A new node is added

• The graph is restructured

• The previous node is updated

• The node is deleted from the graph

How is the shortest path from the start node to a goal node outputted?

• By listing all nodes in sequential order

• By reversing the path from the goal node to the start node

• By calculating the total weight of the path

• By finding the node with the maximum distance

What does the algorithm do when all nodes have been visited?

• It restarts with the next unvisited node

• It terminates

• It checks for negative weight cycles

• It recalculates all paths

What is the correct way to trace back the shortest path from the goal node to the start node?

• By following the nodes with increasing distances

• By following the previous nodes from the goal to the start

• By recalculating the path using a different algorithm

• By selecting nodes randomly until the start is reached