Graph representation using a matrix.

System storing messages for asynchronous processing.

Hierarchical data structure.

Graph traversal exploring level by level.

First-in-first-out data structure.

Tree where each node has at most two children.

Graph traversal exploring deeply before backtracking.

Last-in-first-out data structure.

Ordered binary tree supporting efficient search.

Ordering vertices according to directed dependencies.