Process of visiting elements of a data structure.

Directed acyclic graph.

Algorithm constructing a minimum spanning tree using sorted edges.

Visiting nodes in a tree according to an ordering.

Graph whose vertices can be divided into two independent sets.

Ordering vertices of a directed acyclic graph.

Tree traversal visiting node before its children.

Relationship where two graph vertices are directly connected.

Arranging data according to an ordering.

Tree traversal visiting left subtree, node, then right subtree.