It’s a terminology question:
In the directed graph, What’s the name of the node which does not have any incoming edge (root)?
In my following example (B):
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
It’s a terminology question:
In the directed graph, What’s the name of the node which does not have any incoming edge (root)?
In my following example (B):
From my CS education, I remember calling nodes like B with only outgoing edges “sources”, and nodes like A and D with only incoming edges “sinks”.