Programming, Algorithms, Data, Tech, Web Development.
side has no single point to “enter” (it’s rather a forest than a single tree), in the contrary, the graph in the right illustration doesn’t have unreachable vertices. Sounds familiar. A graph is connected when there is a path between every pair of vertices. [Wikipedia] Obviously, there isn’t a path