concept of neighbouring nodes at this point. Neighbouring nodes of a node in a graph are
those nodes that are one branch away from the node under consideration. Thus, nodes 2, 3
and 4 are the neighbouring nodes of node-1 in the graph in Fig. 17.1-4(a).
A node in a graph should have at least one neighbouring node if the graph is a
connected graph. Therefore, a tree for a connected graph can be constructed by the follow-
ing algorithm.
Select an arbitrary node, say node-j, as the seed node. Poll the remaining nodes one
by one, starting with node-1 and reaching up to node-n but excluding node-j. When a par-
ticular node is polled, check to see whether ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.