Adjacent Nodes |
Two nodes are adjacent if there exists an edge between them. |
Path |
A sequence of connected nodes. |
Simple Path |
A path where each node appears at most once. |
Cycle |
A path that starts and ends at the same node. |
Simple Cycle |
A cycle where each node, except the first and last, appears at most once. |
Connected Graph |
A graph where there exists a path between every pair of distinct nodes. |
Disconnected Graph |
A graph with at least two disjoint subgraphs. |
Connected Component |
A connected subgraph within a disconnected graph. |
Complete Graph |
A graph where every pair of distinct nodes is connected by an edge. |
Subgraph |
A graph that is derived from another graph by selecting a subset of its vertices and edges. |
Weighted Graph |
A graph where each edge is assigned a weight. |
Directed Graph (Digraph) |
A graph where edges have a direction specified. |
Directed Edge |
An edge in a directed graph with a specified direction. |
Predecessor and Successor |
In a directed graph, if (x, y) is a directed edge, y is a successor of x and x is a predecessor of y. |