Also, “connected” in graph theory usually means “there is a path from every node to every other node”, not “there are edges between every node”.
The word “fully” there is meant to be a significant qualifier, and he explains what he means immediately afterwards. If he had referred to it as a “complete” graph instead, I don’t imagine that as many readers would have understood that sentence, though I probably would have put a “directly” in between “not” and “connected.”
The word “fully” there is meant to be a significant qualifier, and he explains what he means immediately afterwards. If he had referred to it as a “complete” graph instead, I don’t imagine that as many readers would have understood that sentence, though I probably would have put a “directly” in between “not” and “connected.”