Q8Single correct4 Marks22 Dec 2024

A directed graph $G$ is shown below. Suppose we are trying to perform an algorithm to find the shortest path from vertex $v_0$ to $v_4$. Which of the following statements is (are) correct?

A

Dijkstra's algorithm can be used to find the shortest path from $v_0$ to $v_4$.

B

Bellman-Ford algorithm can be used to find the shortest path from $v_0$ to $v_4$ because there are negative weighted edges.

C

The weight of the shortest path from $v_0$ to $v_4$ is $1$.

D

Bellman-Ford algorithm cannot be used to find the shortest path from $v_0$ to $v_4$ because there is a negative cycle in the given graph.