How do I call a vertex a parent? We are making graph, not a tree? How can there be parent in graph? I do not understand.
Question ambiguous
@rishabhsetiya7
In Graph theory, a tree is an Undirected, Connected and Acyclic graph. In other words, a connected graph that does not contain even a single cycle is called a Tree.
In graph,Parent means the vertex from which an Edge originates.
Consider a Graph
Here 1,4 are having 0 as their parent.
Now Consider e.g.
4 3
1 2
2 3
2 4
In this graph, we have vertices 1,2,3 and 4.We have egdes between (1,2) ,(2,3),(2,4). Since 1 is the lowest among these, so it becomes the master vertex.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.