unweighted graph

A graph whose edges carry no weights, so every edge counts the same.

In more detail

In an unweighted graph the shortest path is simply the one with fewest edges, which breadth-first search finds in O(V + E). Social networks, where every friendship counts the same, are usually modelled this way.

Related terms

Taught in

References