Shortest Path: The most efficient route between two vertices in a graph, minimising distance, cost or time. Node Cut Set: A subset of vertices whose removal disconnects the graph, used to simplify ...