gabowh gajewskah galambosg galilz gallerb games alpha-beta pruning - hash tables for minimax algorithm - garbage collection gareym gcd (greatest common divisorfunction general-purpose sorting algorithms geometric series getchainfromprevmap function getname function giancarlor global optimums godboles goldberga golinm gonnetg grahamr grandchildren in trees grandparents in trees graph class - graphs - bipartite breadth-first searches coloring definitions for - depth-first searches see depth-first searches -colorable minimum spanning tree - multigraphs network flow problems - np-completeness - planar references for - representation of - shortest-path algorithms for acyclic graph - all pairs dijkstra' algorithm - example - negative edge costs single source - unweighted - topological sorts for - traveling salesman greatest common divisor (gcdfunction greedy algorithms - approximate bin packing see approximate bin packing for coin changing problem dijkstra' algorithm huffman codes - kruskal' algorithm - maximum-flow algorithms minimum spanning tree - processor scheduling - griesd growth rate of functions - gudese guibasl guptar gusfieldd files hagerupt hakend halting problems hamiltonian cycle - hany handlereorient function hararyf harmonic numbers harriesr hash class template - hash function - hash_map function hash_set function hash tables carter-wegman trick cuckoo hashing - - double hashing in - extendible hashing - hash function - hopscotch hashing - linear probing in - overview - perfect hashing - quadratic probing in - references for - rehashing for - separate chaining for - in standard library - universal hashing - hashama hashentry class - hashtable class - header files - header informationcompilation of header nodes for lists heap orderdeques with heap-order property - heaps - binary see binary heaps leftist see leftist heaps pairing - priority see priority queues skew - heapsort analysis - comparing implementation - references for heapsort function - heavy nodes in skew heaps height of trees avl binary tree traversals complete binary hibbardt hibbard' increments - hiding information hirschbergd hoarec hoeyd homometric point sets hopcroftj hopscotch hashing - horvathe hut