(Solved): TOPIC: Appropriate data structure for Dijkstra's algorithm In Dijkstra's algorithm, the fringe con ...

TOPIC: Appropriate data structure for Dijkstra's algorithm In Dijkstra's algorithm, the fringe consists of one entry for each candidate vertex \( v \) for which a path from start to \( v \) - not necessarily the shortest path - has been found. Every time a vertex is removed from the fringe, that vertex's shortest path has been found and it is finalized. The algorithm ends when the stop vertex is returned by next. 1. What is the most appropriate data structure for storing the fringe and why? (100 words minimum)