Concepts4

An Euler path visits every edge exactly once, and an Euler circuit is an Euler path that starts and ends at the same vertex.

Breadth-First Search (BFS) explores a graph level by level, visiting all vertices at distance d from the source before any at distance d+1.

Depth-First Search (DFS) assigns each vertex a discovery time and a finish time that capture a neat nesting structure of recursion.

Depth-First Search (DFS) explores a graph by going as deep as possible along each path before backtracking.