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
- directed graph — A graph whose edges are one-way: an edge from A to B does not imply an edge from B to A.
- minimum spanning tree — The spanning tree of a weighted, connected graph whose edges have the smallest possible total weight.
Taught in
- Representing A Graph: Matrix Or Adjacency List — Algorithms & Data Structures for Working Engineers
- Depth-First Search, Cycles And Topological Order — Algorithms & Data Structures for Working Engineers
- Minimum Spanning Trees: Kruskal And Prim — Algorithms & Data Structures for Working Engineers