Directed Tree: Revision history

View logs for this page

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

curprev 11:2911:29, 26 May 2015‎ Weihe talk contribs‎ 6,871 bytes +2‎ No edit summary
curprev 11:2811:28, 26 May 2015‎ Weihe talk contribs‎ 6,869 bytes +23‎ →‎Multi-way Search Trees

curprev 14:3214:32, 17 May 2015‎ Weihe talk contribs‎ 6,599 bytes +6‎ →‎Definitions
curprev 10:5010:50, 17 May 2015‎ Weihe talk contribs‎ 6,593 bytes +55‎ No edit summary

curprev 06:2006:20, 1 October 2014‎ Jhohmann talk contribs‎ m 6,538 bytes +47‎ No edit summary

curprev 18:4418:44, 29 September 2014‎ Jhohmann talk contribs‎ 1,239 bytes +1,239‎ Created page with "== Definitions == # A '''directed tree''' is a directed graph <math>T = (V,A)</math> with a designated node <math>r \in V</math>, the '''root''', such that for each node <math..."

Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/Directed_Tree"

Navigation menu