hop

One step along an edge; a path's hop count is how many edges it crosses, ignoring any weights.

In more detail

BFS finds paths with the fewest hops, such as the degrees of separation between two people in a social network. When edges have different weights, fewest hops is not the same as cheapest, and Dijkstra's algorithm is needed.

Related terms

Taught in

References