In this program
- Graph fundamentals
- Counting and combinatorics
- Graph algorithms and structures
Graph algorithms and structures
Graph theory & combinatorics · Standard syllabus
Breadth-first and depth-first search
Objectives
- Breadth-first and depth-first search
- Shortest paths: Dijkstra's algorithm (introduction)
- Matchings
- Hall's marriage theorem (statement)
- Vertex and edge colorings; chromatic number
- Ramsey theory (introduction)
Study materials
- Study guideComing soon
- Exam StrategyComing soon
- Common MistakesComing soon
- WorksheetsComing soon
- Word problemsComing soon
- Mixed PracticeComing soon
- Multi-Unit ProblemsComing soon
- ReviewComing soon
- Practice testComing soon
- Answer keyComing soon
Interactive practice
Quizzes, typed answers, and flashcards for this unit — coming soon.
- Coming soon
Quiz
Multiple-choice questions with instant feedback
- Coming soon
Typed practice
Type answers and check them
- Coming soon
Flashcards
Vocabulary and key facts
- Coming soon
Mixed quiz
Harder mixed review for this standard