Does a connected graph mean that every vertex is connected to every other vertex by a single edge or that only adjacent vertices are connected by edges?
Connected graph simply means that there should be atleast one path between each vertex.
It is not always necessary to have direct edge between each vertices.
is a connected graph too although there is no direct edge between end vertices.
Thank you so much!! I’ve wasted so much time on this because I thought every point had to be connected to every other one!
Connected = every vertex can reach every other vertex
Fully connected = every vertex has an edge to every other vertex