Which term refers to an algorithm that computes shortest paths from a single source vertex in a graph, even with negative edge weights?

Question

Accepted Answer

A. Bellman-Ford algorithm — Bellman-Ford algorithm refers to an algorithm that computes shortest paths from a single source vertex in a graph, even with negative edge weights.

Answer

A. Bellman-Ford algorithm

Answer

B. Space complexity

Answer

C. Amortized analysis

Answer

D. Selection sort

Which term refers to an algorithm that computes shortest paths from a single source vertex in a graph, even with negative edge weights?

Correct answer

Explanation