I\'m currently making a program to check whether a graph is fully connected. My approach is to use a depth-first search traversal algorithm, and just ensure that every node is c