graph distance

in graph theory, the minimum number of edges in a path connecting two vertices

en-GB/ɡɹɑːf ˈdɪstəns/
en-US/ˈɡɹæf ˈdɪstəns/

Categories:

metric function