Menu
Is there a name for a tree like graph, where nodes can have multiple parents, but still from only 1 level above.
Therefore the graph is directed and acyclic, but it has other constraints as well.
This will also mean that, all paths from any particular node back to the root are the same length.
866
Yes, you can have nodes have both “children” and “parents”. However that is no longer a tree structured graph, so you will not be able to use a TreeModel – you must use a GraphLinksModel.
All nodes have exactly one parent, except the topmost root node, which has none. A node might have many ancestor nodes, such as the parent's parent.
Undirected Trees. • An undirected graph is a tree if there is. exactly one simple path between any pair. of nodes.
A directed tree is an acyclic directed graph. It has one node with indegree 1, while all other nodes have indegree 1 as shown in fig: The node which has outdegree 0 is called an external node or a terminal node or a leaf. The nodes which have outdegree greater than or equal to one are called internal node.
I believe that this is called a layered graph. A graph of this sort is a graph where you can split the nodes into groups L1, L2, ..., Ln such that each edge (u, v) goes from some layer Li to a second layer Li+1.
Hope this helps!
74
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
