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