1. Lecture 12: Algorithm Review

2. General Problem Solving Methods Divide & Conquer Greedy Method Dynamic Programming Graph & Tree Traversal Backtracking Branch & Bound Constraint Relaxation Reduction Methods

3. Searching & Sorting Binary Search Merge Sort Quicksort Topological sort

4. Graph & Tree Traversal Prim's Algorithm Minimum Spanning Tree Dijkstra's Single-Source Shortest-Path Depth-First Search Hamiltonian Circuits Maximal Matching Graph Coloring algorithm B&B TSP B&B TSP with Constraint Relaxation Max-Flow Min-Cut (Ford-Fulkerson) Dijkstra's Single-Source Shortest-Path (SSSP) Floyd's All-Pairs Shortest-Path (APSP) Natural Clustering (Dendrograms)

5. Greedy Matching Greedy Coin Changing Prim's Algorithm Minimum Spanning Tree Track Correlation Greedy Euclidean TSP Floyd's All-Pairs Shortest-Path (APSP) Simplex Method Greedy Methods

6. Dijkstra's Single-Source Shortest-Path Making Change (non-Greedy) Davis-Putnam 3-SAT Algorithm 0/1 Knapsack Problem Dynamic Programming

7. Augmenting Path Algorithm Maximal Matching Munkres Assignment - Hungarian algorithm Track Correlation B&B TSP with Constraint Relaxation Max-Flow Min-Cut (Ford-Fulkerson) Simplex Method Natural Clustering (Dendrograms) Constraint Relaxation Methods

8. General Combinatorial Algorithms Depth-First Search Hamiltonian Circuits Next Permutation Graph Coloring algorithm Optimal Traveling Salesperson Problem Algorithms Cross & Insert Heuristics for Routing Davis-Putnam 3-SAT Algorithm Solution-Set Enumeration (3-SAT) Sum-of-Subsets N-Queens Problem Methods Backtracking Algorithms

9. Dictionary of Algorithms and Data Structures This web site is hosted in part by the Software and Systems Division, Information Technology Laboratory.Software and Systems DivisionInformation Technology Laboratory This is a dictionary of algorithms, algorithmic techniques, data structures, archetypal problems, and related definitions. Algorithms include common functions, such as Ackermann's function. Problems include traveling salesman and Byzantine generals. Ackermann's functiontraveling salesmanByzantine generals Some entries have links to implementations and more information. Index pages list entries by area and by type. The two-level index has a total download 1/20 as big as this page.implementationsareatypetwo-level index http://www.itl.nist.gov/div897/sqg/dads/

10. ADF CH BEG Graph Traversals depth-first from node ___ : ___ ___ ___ ___ ___ ___ ___ ___ breadth-first from node ___ : ___ ___ ___ ___ ___ ___ ___ ___ hamiltonian path ___ ___ ___ ___ ___ ___ ___ ___

11. Greedy Tour greedy tour starting from node ___ : ___ ___ ___ ___ ___ ___ ___ ___ lower bound heuristic computing minimum cost to leave each city _______ lower bound heuristic computing minimum cost to enter each city _______

12. 2 C D F E A G B 4 2 3 5 1 2 1 2 1 2 1 Graph Representations ___ ___ ___ ___ ___ ___ ___ adjacency matrix ___ ___ ___ edge list

13. 2 C D F E A G B 4 2 3 5 1 2 1 2 1 2 1 Minimal Spanning Tree ___ ___ ___ edge list of MST

14. 2 C D F E A G B 4 2 3 5 1 2 1 2 1 2 1 Single-Source Shortest Path ___ ___ ___ ___ ___ ___ from node ____ {__} {__ __} {__ __ __} {__ __ __ __} {__ __ __ __ __} {__ __ __ __ __ __}