树的奇怪概括？
在处理有向图时，树是一种图，其中除了一个（根）之外的每个节点都有单个入边？是否有任何树状结构的例子，其中每个节点至多有一些恒定数量的传入边？最多两个，还是最多三个？我还没有遇到过任何专门以这种方式描述的图表；它们有特定的应用吗？
When dealing with directed graphs, a tree is a graph in which every node except one (the root) has a single incoming edge? Are there any examples of treelike structures in which every node has at most some constant number of incoming edges; say, at most two, or at most three? I haven't come across any graphs specifically described this way; is there a particular application in which they are used?
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（3）
在图论中，树是连通的无环图。不要求每个节点都有一个传入边。在计算机科学中，我们经常处理与您的定义一致的有根树。
以下是对树的一种描述，其中某些节点具有恒定数量的传入边：将项目分配给员工，其中每个员工最多可以分配三个项目。
In graph theory, a tree is a connected acyclic graph. There is no requirement that every node have one incoming edge. In computer science, we often deal with rooted trees that agree with your definition.
Here is one description of a tree where some of the nodes have a constant number of incoming edges: an assignment of projects to employees, where each employee can be assigned at most three projects.
树最常见的概括是“DAG”（有向无环图），它是切向相关的，但没有设置邻域大小的最大值（通向顶点的弧）和单个源（顶点）的规格附近空无一人）。
据我所知，对于您正在寻找的内容，没有一个简洁的术语。您需要找到一位对图论有浓厚兴趣的真正数学家才能确定！
The most common generalization of a tree is a "DAG" (Directed Acyclic Graph) which is tangentially related but does not set a maximum on the size of in-neighborhoods (arcs which lead into a vertex) and specification of a single source (vertices with empty in-neighborhood).
From what I know, there's no neat term for what you're looking for. You'll need to find a true mathematician with a deep interest in graph theory to know with any certainty!
格子 (偏序集）具有该属性。
Lattices (partially ordered sets) have that property.