Graphs

Vertices connected by edges — model networks, maps, circuits and dependencies.

Intermediate

A graph $G = (V, E)$ can be directed or undirected, weighted or unweighted. Stored as:

Adjacency list — each vertex lists its neighbours ( $O(V + E)$ memory, best for sparse graphs).
Adjacency matrix — a $V \times V$ table ( $O(V^2)$ , fast edge checks).

A circuit netlist is a graph (nodes = nets, edges = components) — nodal analysis is graph theory in action.

Sub-topics (3)

Explore a graph level by level using a queue; finds shortest paths in unweighted graphs.

Intermediate♥ 0🔖 0💬 0

Explore as deep as possible before backtracking; uses recursion or a stack.

Intermediate♥ 0🔖 0💬 0

Shortest paths from one source in a graph with non-negative edge weights.

Advanced♥ 0🔖 0💬 0

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.