Path that returns to its starting vertex.

Provides an alternative branch of conditional logic.

Key-value data structure.

Balanced tree optimized for storage systems.

Directed graph containing no cycles.

Selects among multiple cases.

First-in-first-out collection.

B-tree variant storing records primarily at leaves.

Ordering of vertices in a directed acyclic graph.

Compact conditional expression with three operands.