You are not allowed to print this document.

Shortcut to seniority

Badea Robert

Vertex: Node containing data

Edge: The line that connects two vertices

Cycle: Cycles occur when nodes are connected in a way that they forms a closed structure.

Cycle: Cycles occur when nodes are connected in a way that they forms a closed structure.

Self loop: An edge that connects a vertex to itself (source = destination).

Divide et impera (Divide and conquer): Break the problem into sub-problems and solve them each recursively.

Negative weight edge refer to edges with a negative cost.