This repository contains solutions to various graph-related problems implemented in different programming languages.
Graph problems are fundamental in computer science and have wide applications in various domains. This repository serves as a collection of solutions to graph problems, providing implementations in different programming languages.
Feel free to explore the solutions, learn from them, and contribute your own solutions.
The repository is organized into folders based on the problem being solved. Each language folder contains solutions to various graph problems.
Feel free to navigate to the problem of your choice and explore the solution in different programming languages.
- Problem 1: RoadSystem convenience that checks if all nodes in the graph have the same number of incoming and outgoing edges
Each problem folder contains a detailed README explaining the problem, the approach used, and the code.
If you have a new graph problem to add or want to contribute a solution in a different language, follow these steps:
- Fork the repository.
- Create a new branch for your feature:
git checkout -b feature-name. - Implement the solution or add a new problem.
- Commit your changes:
git commit -m "Add feature-name solution in language". - Push to the branch:
git push origin feature-name. - Submit a pull request.
Feel free to open an issue if you have questions or suggestions.
This repository is licensed under the MIT License - see the LICENSE file for details.