Wiki-palvelun osoite wiki.helsinki.fi muuttuu wiki-emerita.it.helsinki.fi -osoitteeksi 4.12.2023 – katso lisätietoja tiedotteestamme: https://flamma.helsinki.fi/s/1uCkV
The Wiki address wiki.helsinki.fi will change to wiki-emerita.it.helsinki.fi on 4 December 2023 – see more information on Flamma: https://flamma.helsinki.fi/s/sreoE
Wiki-tjänstens adress wiki.helsinki.fi ändras till wiki-emerita.it.helsinki.fi 4.12.2023 – läs mer i vårt meddelande: https://flamma.helsinki.fi/s/fe3MT
A node in a directed graph is called a root if it has indegree zero, i.e., there are no edges pointing to it. Moreover, it is usually thought that a rooted tree or a rooted graph has only one root (cf. origin). A counterexample would be a text that grew out of two texts, each of which had its own original (being its root). The presence of (at least) one root is required for a tree to be called a stemma.