closeness
breadth
Johnson's algorithm
superconcentrator
Suurballe's algorithm
Canadian traveller problem
Menger's theorem
Chinese postman problem
Eppstein's algorithm
king
nonblocker
edge
cutwidth
undirected path
Herschel graph
reachability
path length
bipartization
supervertex
connected graph
cut
Hamiltonian path
empty graph
Floyd-Warshall algorithm
laceable
Desargues graph
clique number
Bellman-Ford algorithm
bidirected
degree sequence
strongly connected
gammoid
Steiner tree
girth
isthmoid
Borůvka's algorithm
plumbago
outbranch
small-world network
graph theory
Dijkstra's algorithm
pseudo-edge
dominate
cherry graph
vertex
pseudograph
order
graph antihole
complete graph
directed path