Sign inSign in

Distance estimate matrix

A matrix DmD^{m} whose entries store the weight of the shortest path between every pair of vertices using at most m edges.
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.

Matrix representation of graphs1Shortest path problem1

Lecturers

1

    Connections

    2

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

    Concept1

    Lecture1

    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.