Description

10 steps: (1) A GRAPH G=(V,E): vertices (nodes) and edges (connections). (2) DEGREE of vertex: number of edges touching it. Sum of all degrees = 2|E|. (3) PATHS: sequence of vertices connected by edges. CYCLE: path that returns to start. (4) CONNECTED: path exists between every pair of vertices. (5)

Details