Search results

Page title matches

• B-tree: shift key to sibling
  [[Category:B-Tree]]
  4 KB (708 words) - 23:17, 19 June 2015

Page text matches

• B-tree: insert and rearrange
  [[Category:B-Tree]] # Three pointers <math>p, p_1, p_2 </math> of type "pointer to B-tree node".
  4 KB (689 words) - 23:19, 19 June 2015
• Binary search
  ...ue <math>r-\ell</math> is roughly halved in every descent in the recursion tree.
  2 KB (298 words) - 06:29, 27 April 2016
• Sorted sequence
  # [[Binary Search Tree]]
  2 KB (270 words) - 13:06, 21 May 2015
• Basic graph definitions
  # A '''forest''' is a [[#Cycles|cycle-free]] undirected graph. A '''tree''' is a connected forest. ...h of <math>G</math> that is a forest/tree/branching/arborescence. A forest/tree/branching/arborescence is '''spanning''' if it contains all nodes of <math>
  15 KB (2,712 words) - 14:47, 16 May 2015
• Algorithms and correctness
  ...on of the recursive routine, this means that every branch of the recursion tree must reach the break condition after a finite number of recursive descents. ...: after a finite number of recursive calls in each branch of the recursive tree.
  12 KB (1,782 words) - 12:49, 28 April 2016
• B-tree: shift key to sibling
  [[Category:B-Tree]]
  4 KB (708 words) - 23:17, 19 June 2015
• Kosaraju
  4 output the vertices of each tree in the '''DFS''' forest of step 3 as a separate strongly connected componen
  4 KB (789 words) - 07:37, 2 November 2015
• Hopcroft-Tarjan
  ...h> or an immediate or non-immediate successor of <math>v</math> in the DFS tree.
  6 KB (1,028 words) - 13:31, 3 November 2015
• Breadth-first search
  [[Category:Tree Algorithms]]
  7 KB (1,165 words) - 07:50, 26 October 2015
• Depth-first search
  [[Category:Tree Algorithms]]
  11 KB (1,966 words) - 06:52, 26 October 2015

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)