Graph basics I

Consider the following weighted directed graph:

Dijkstra algorithm is ran, starting at \(S\). What is the order in which vertices get removed from the priority queue?


Image credit: snipview
×

Problem Loading...

Note Loading...

Set Loading...