This repository contains a collection of algorithms and data structures implemented in Python. Each file represents a different algorithm or data structure, and they can be used as standalone modules.
- Bellman-Ford Algorithm
- Breadth-First Search
- Binomial Coefficient
- Closest Pair
- Cycle Detection using DFS
- Depth-First Search
- Hamiltonian Cycle
- Huffman Coding
- Knapsack Problem
- Knapsack Problem (Approximate Solution)
- Kruskal's Algorithm
- Maximum Flow
- Maximum Numbers
- N-Queens Problem
- Splay Trees
- Stable Marriage Problem
- Traveling Salesman Problem
- Traveling Salesman Problem (Alternative Solution)
- Traveling Salesman Problem (BFS Approach)
Feel free to use these algorithms and data structures in your projects. Each file is self-contained and can be imported as a module into your Python code.
If you'd like to contribute or improve the existing implementations, follow these steps:
- Fork the repository
- Create a new branch (
git checkout -b feature/improvement) - Make your changes and commit them (
git commit -m 'Add your message here') - Push to the branch (
git push origin feature/improvement) - Open a pull request
This project is licensed under the MIT License, which means you are free to use, modify, and distribute the code for both commercial and non-commercial purposes.