undirected graph

A graph whose edges work both ways: an edge between A and B lets you go from either to the other.

In more detail

Friendships and two-way roads are undirected. An adjacency list records each undirected edge twice, once for each end, so it holds 2E entries. Minimum spanning trees are defined on undirected graphs.

Related terms

Taught in

References