Q$3\mathrm{.}5$ TF #$5$

$1$ Point

Grading comment:

In a graph that contains some negatively$-$weighted edges, but no negative cycles, Dijkstra's algorithm will always compute the correct shortest path from the start node

$$

s to any node in the graph.

Choice $1$ of $2$:True

Choice $2$ of $2$:False