Final Topics
-----------------------------------------------------------------------------
Topics from Exams 1, 2 & 3

9	Graphs	
9.1	Graph Terminology
	Graph ADT
	Graph Implementations
	+ Adjacency Matrix
	+ Adjacency List
	Graph traversals
	+ Depth-First Search
	+ Breadth-First Search
9.2	Topological Sorting
9.3	Shortest Paths Algorithms
	+  Dijkstra's Algorithm
9.5	Minimum Spanning Trees
	+ Prim's Algorithm
9.6	Circuits
	+ Euler
	+ Hamiltonian
9.7	Traveling salesperson problem

10	Algorithm Design Techniques
10.1	Greedy Algorithms
	+ Job Scheduling
	+ Huffman Codes
	+ Approximate Bin Packing
10.2	Divide and Conquer
	+ Closest Pair of Points
10.3    Dynamic Programming
10.4	Randomized Algorithms
10.5	Backtracking Algorithms