ConceptTheory & Algos
Diameter of a graph
The maximum distance between any pair of vertices in the graph.
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
2Each in their own terms, from the easiest level.
Erik Demaine
The longest shortest path between any two nodes in a graph.
Connections
3The lectures that define it or assume it, and the concepts next to it.