Repository that contains the next topics:
- Divide and conquer
- Coin Change problem
- Rat in a maze problem
- String manipulation
- Graph Theory Problems
- Dijkstra (shortest path from one node to every node)
- Floyd Warshall (shortest paths of every node from one node to every node)
- Knapsack Problem (Dynamic Programming)
- Graph coloring (Welsh Powell algorithm)
- Minimum spanning Tree (Prim's algorithm using PQ)
- Traveling Salesman Problem (Dynamic Programming)
- Max Flow graph (Ford Fulkerson Algorithm)
How to Run Code?
- Open terminal navigate to the Activity's root folder
- Next up, type: g++ -std=c++11 main.cpp -o app
- After creating the executable, type ./app