Adjacency Matrix: A way to represent a graph using a matrix where each cell represents whether there is an edge between two nodes.
Depth-First Search (DFS): An algorithm that explores as far as possible along each branch before backtracking in a graph.
Breadth-First Search (BFS): An algorithm that explores all the vertices of a graph in breadth-first order, i.e., it visits all the neighbors before moving on to their neighbors.