Definition:Arborescence/Also defined as
Jump to navigation
Jump to search
Definition
Variants of the definitions can be found, as follows:
- Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms defines an arborescence of root $r$ so as to reverse the orientation of $G$, so that the arcs are all directed toward the root rather than away from it.
- John E. Hopcroft and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation specifies that the successors of each vertex to be ordered "from the left", without specifying exactly what that means.
Sources
- 1979: John E. Hopcroft and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation ... (previous) ... (next): Chapter $1$: Preliminaries: $1.2$ Graphs and Trees: Trees