3.6 Connectivity

Two vertices v and w are connected if there exists at least one path between v and w.