Data Structures II - Test #3
November 30, 2005

Graphs
  1. Graph Representations
  2. Graph Traversals
  3. Shortest Paths, one to one, one to all, all to all, Dijkstra's, WFI
  4. Topological Sort
  5. Min-cuts, Max-Flows
  6. cycles and cycle detection
  7. union-find
  8. minimum cost spanning trees
  9. Connectivity, cut-points, weakly and strongly connected
  10. Matching
  11. Stable marriage problem, Assignment Problem
  12. Eulerian Graphs
  13. Hamiltonian Graphs, Travelling Salesman problem
  14. Graph Coloring

Top of this page   Top of page      Home page   Home page