• Presentation
• Problems, algorithms, correctness, and complexity
• Graphs and digraphs
• Random Graphs
• ADTs for graphs
• Trees
• Traversal algorithms
• Shortest paths
• Routing
• Minimum spanning trees
• Maximum flows
• Connectivity
• Matchings
• Case study: matching high-school teachers to schools according to portuguese law (in portuguese)
• Switching
• Introduction to game theory