Breadth First Search (BFS)

A collection of vertices and edges representing connections.

An algorithm for traversing or searching tree or graph data structures, exploring all neighbors at the present depth prior to moving on to vertices at the next depth level.

A square matrix used to represent a finite graph, where the elements indicate whether pairs of vertices are adjacent or not.

A collection of lists or arrays that represent which vertices are adjacent to each vertex.

A data structure used in BFS to keep track of the vertices that need to be explored.

The process of determining the route taken to reach a specific vertex in a graph, often achieved by keeping track of parent vertices.