dfs and dijkstra #2
Description
I think the codes you have written belong to the dfs algorithm but not dijkstra, because the dijkstra algorithm uses the greedy strategy and each time the shortest distance is selected and added to the set.
{{ message }}