What do you call a graph where all nodes are reachable?

371 Views Asked by At

simple question.

What's the term for an (undirected) graph, where one can reach any other node from any node?

1

There are 1 best solutions below

3
On BEST ANSWER

Let me do this in a proper answer folks.

Yes, it's a connected graph - a graph that for any two given nodes, has a path between them.

But It's a confusing name. Is anyone else annoyed by confusing names in maths? Not that we can do anything about it, this far.