Week 3: Graph Data Structures and Algorithms (16)

16

Graph Terminology (cont)

Connected graph

there is a path from each vertex to every other vertex
if a graph is not connected, it has ≥2 connected components

Complete graph K_V

there is an edge from each vertex to every other vertex
in a complete graph, E = V(V-1)/2

[Diagram:Pic/complete.png]