Node in a graph.

Greedy minimum spanning tree algorithm.

Communication through exchanged messages.

Sequence of nodes connected by references.

Connection between graph vertices.

Defined procedure for solving a problem.

Communication mechanism between concurrent components.

Linked list with forward and backward references.

Graph whose edges have directions.

Measure of computational resource requirements.