Undirected Graph

overview

Summary

An undirected graph models relationships where connections have no direction, like mutual friendships or two-way roads. It consists of vertices (nodes) and edges that connect pairs of vertices. Key ideas include degree, connectivity, components, cycles, and trees. You represent it with adjacency lists or matrices, then run core traversals like BFS and DFS to analyze structure and solve problems.