Dijkstra's algorithm works correctly, because all edge weights are non-________...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Dijkstra's algorithm works correctly, because all edge weights are non-________, and the vertex with the least shortest-path estimate is always chosen.
0%
0%
0%