Graph

Related terms

• Breadth-first search — Visiting a tree or graph level by level, nearest nodes first, using a queue. It finds shortest paths in unweighted graphs.
• Depth-first search — Visiting a graph by going as deep as possible along one path before backing up, using recursion or a stack.
• Adjacency list — A graph representation that stores, for every vertex, the list of its neighbours. It uses memory proportional to V + E and suits sparse graphs.

← All terms