Sign inSign in

Bellman-Ford algorithm as DAG shortest path

The Bellman-Ford algorithm can be viewed as finding the shortest path in a directed acyclic graph (DAG) constructed by unrolling the graph into V−1V-1 layers.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Dynamic programming1Graph representations1Shortest paths in DAGs1

Lecturers

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.