- Applying depth first search (DFS), breadth first search (BFS), and Dijkstra from scratch
- Example for applying netowrkx package on a weighted graph
- Knapsack implementation on different weights, values, and types.
- 1/0 knapsack using max profit
- 1/0 knapsack using min weight
- 1/0 knapsack using max profit/weigth
- Fractional knapsack using max profit
- Fractional knapsack using min weight
- Fractional knapsack using max profit/weigth