I am going through Professor Skiena's textbook and he says that there are 3 types of cut-nodes - root, bridge cut node, and parent cut node.
Now if the earliest reachable ancestor from a node is itself, it's parent and the node (if not leaf) become bridge cut nodes.
My question is that we have a simple 2-node undirected graph ->
A --- B.
In this case, B's earliest reachable ancestor is B itself and hence A becomes the bridge cut node. However, I am unsure that should be the case; since if I delete A, even then B exists and the
num_components = 1?