Wiki source code of Leaf

Last modified by 14zunde on 2024/02/13 07:40
Show last authors
1 A node in a [[graph>>doc:stemmatology.Graph.WebHome]] is a //leaf// (or a //leaf node//) if it has [[degree>>doc:stemmatology.Degree.WebHome]] one and the only edge associated to the node is either undirected or is directed to it. Hence, in an undirected graph, all degree one nodes are leafs. In a directed graph, each degree one node is either a [[root>>doc:stemmatology.Root.WebHome]] or a leaf. It is usually required that a tree or a graph only have at most one root node.
2
3 ==== Illustration ====
4
5 [[image:url:https://wiki.hiit.fi/download/thumbnails/32247083/edge.png?version=2&modificationDate=1446143621100&api=v2]]
6
7 Fig. 1. Example of a graph depicting the names of important parts of a graph or tree.
8
9 ==== In other languages ====
10
11 DE: Blatt
12 FR: feuille
13 IT: foglia
14
15
16 [[TR>>doc:stemmatology.Parvum lexicon stemmatologicum.Contributors.WebHome]], [[PR>>doc:stemmatology.Parvum lexicon stemmatologicum.Contributors.WebHome]] (drawing)
17
18