| cover | coverY |
|---|---|
-65 |
- Introduction to graph
- What is a graph
- Breadth-first search
- Implementing the graph
- Implementing the algorithm
- Recap
- Working with Dijkstra's algorithm
- Terminology
- Trading for a piano
- Negative-weight edges
- Implementation
- Recap
- The classroom scheduling problem
- The knapsack problem
- The set-covering problem
- NP-complete problems
- Traveling salesperson, step by step
- Recap
- The knapsack problem
- Knapsack problem FAQ
- What happens if you add an item?
- What happens if you change the order of the rows?
- Can you fill in the grid column-wise instead of row-wise?
- What happens if you add a smaller item?
- Can you steal fractions of an item?
- Optimizing your travel itinerary
- Handling items that depend on each other
- Is it possible that the solution will require more than two sub-knapsacks?
- Is it possible that the best solution doesn't fill the knapsack completely?
- Longest common substring
- Recap
- Classifying oranges vs. grapefruit
- Building a recommendations system
- Introduction to machine learning
- Recap