The diameter of a graph is the maximum value of the minimum distance between any two nodes.

In addition suitable contents:
[ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ b ] [ be ] [ ch ] [ de ] [ du ] [ ee ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ gr ] [ graph ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ is ] [ Lex ] [ lu ] [ ma ] [ meter ] [ mo ] [ mod ] [ module ] [ mu ] [ na ] [ nc ] [ ni ] [ no ] [ node ] [ ph ] [ query ] [ rc ] [ re ] [ se ] [ st ] [ T ] [ th ] [ tw ] [ um ] [ va ] [ value ]