这种有向无环图的名称是什么？
也许它甚至不是 DAG，但正如它的命名一样，我不确定该给它起什么标题...
每个节点只能有 0 或 1 个路径进入它的数据结构的名称是什么？ 严格来说，这是一棵树吗？
谢谢
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
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（2）
这是一棵有向树。 像这样的普通树是没有方向的。
您的约束并不精确地定义树的方式（树的定义是任何两个顶点通过不超过一条路径连接），但它确实将您的图限制为有效的有向树。 （除非你想使用需要统一向性的“有向树”的奇怪用法，我不能说这让我感兴趣。）
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.)
还有其他限制吗？ 仅根据您提供的信息，我可以构建一个不是树的图。
A-> B-> A
如果添加图是非循环的约束，那么它将是一棵树。
Are there any other constraints? From only the one you've given I can construct a graph that is not a tree.
A -> B -> A
If you add the constraint that the graph is acyclic, then it would be a tree.