Content deleted Content added
In terms of graph theory, a tree can be described as a "directed acyclic graph". A collection of unconnected tree structures is sometimes described by graph theorists as a "forest". |
nl: boomstructuur |
||
Line 1:
[[nl:boomstructuur]]
A '''tree structure''' is a way of representing the [[hierarchy|hierarchical]] nature of a [[structure]] in a graphical form. It is named a 'tree structure', because the graph looks a bit like a tree, even though the tree is generally shown upside down compared with a real tree, that is to say with the root at the top and the leaves at the bottom.
|