Reingold-Tilford algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

Introduced in a 1981 paper by Edward Reingold and John Tilford.

Noun[edit]

Reingold-Tilford algorithm (plural Reingold-Tilford algorithms)

  1. (computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).
Retrieved from "https://en.wiktionary.org/w/index.php?title=Reingold-Tilford_algorithm&oldid=77964077"