A graph is connected if there exists a path (not necessarily an edge) between all vertices (a.k.a nodes).