splay trees - treaps - vectors - deletekey function deletemax function deletemin function binary heaps - binomial queues - -heaps - dijkstra' algorithm - fibonacci heaps - heapsorts - huffman algorithm - kruskal' algorithm - leftist heaps - multiway merges - pairing heaps - priority queues - skew heaps - demersa dense graphs deon depth-first searches - biconnected graphs - directed graphs - euler circuits - for strong components - undirected graphs - depth of trees deques with heap order dequeue operations dereferencing pointers descendants in trees design rule in recursion destructors - for binary search trees - for matrices devroyel dfs function diamond dequeues dictionariesrecursion in dietzfelbingerm digraphs all-pairs shortest paths in - depth-first searches - representation of - dijkstrae dijkstra function - dijkstra' algorithm - for all-pairs shortest paths - and prim' algorithm - time bound improvements for - dimensions for - trees diminishing increment sorts see shellsort dingy dinice directed acyclic graphs (dags) - directed edges directed graphs - all-pairs shortest paths in - depth-first searches - representation of - directories in extendible hashing - trees for disjoint sets - dynamic equivalence problem in - equivalence relations in for maze generation - path compression for - references for - smart union algorithms for - structure of - worst case analysis for union-by-rank approach - disjsets class - disk / operations in extendible hashing - and running times - in sorting distancesclosest points problem - divide and conquer strategy - closest points problem - components - integer multiplication - matrix multiplication - maximum subsequence sum - in mergesorts - quicksort see quicksort running time of - selection problem - dord dosag double hashing - double rotation operations - doublewithleftchild function doubly linked lists - - - doylej drand function dreyfuss driscollj duh duem dumeya dumpcontents function duplicate elements in quicksorts dynamic equivalence problem - dynamic objects dynamic programming - all-pairs shortest path - optimal binary search trees - ordering matrix multiplications - references for tables vs recursion - eckelb edelsbrunnerh edges in depth-first searches - graph - tree edmondsj eight queens problem eisenbathb electrical connectivity