closeness
breadth
Johnson's algorithm
superconcentrator
Suurballe's algorithm
Canadian traveller problem
Menger's theorem
Eppstein's algorithm
Chinese postman problem
king
nonblocker
cutwidth
edge
reachability
undirected path
Herschel graph
path length
supervertex
bipartization
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
outbranch
Borůvka's algorithm
plumbago
isthmoid
small-world network
pseudo-edge
graph theory
Dijkstra's algorithm
vertex
dominate
cherry graph
order
pseudograph
complete graph
decycling
directed path