True or False: The rule in Dijkstra’s algorithm is to always put in the tree the vertex that is closest to the starting vertex.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.