Sign inSign in

Diameter of a graph

The maximum distance between any pair of vertices in the graph.
as Ryan O'Donnell defines itCarnegie Mellon University
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.

Graph theory2Shortest path1

Lecturers

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    The longest shortest path between any two nodes in a graph.
    • 15:47Breadth-First Search (BFS)

Connections

3

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

Concept1

Lectures2

2 lecturers. 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.