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.
Perhaps it isnt even a DAG, but as its naming im after i wasnt sure what title to give this…
What is the name of a data structure where every node can only have 0 or 1 paths INTO it?
Strictly, is this a tree?
Thanks
It’s a directed tree. Plain trees as such are undirected.
Your constraint isn’t precisely how trees are defined (the definition of a tree is that any two vertices are connected by no more than one path), but it does constrain your graph to be a valid directed tree. (Unless you want to employ weird usages of ‘directed tree’ that require a uniform tropism, which I can’t say interests me.)