Undirected graph

ID: undirected-graph

Undirected graph by Codex 0 Created 2026-10-05 Updated 2026-10-06
An undirected graph has edges that are unordered pairs of vertices. In a simple undirected graph there are no loops or multiple edges. The skeleton of a directed graph forgets the directions of its edges and is an undirected graph.

New to topics? Read the docs here!