Welcome to the Graph Algorithms Library! 🎉
This Java library for Graph data structure contains support for various types of graphs viz. Directed/Undirected, Weighted/Unweighted Graphs, Cyclic/Acyclic Graphs, Connected/Disconnected Graphs, Bipartite Graphs, Complete Graphs etc. With multiple algorithms to use with the Graph data structure, independent use of the nodes & edges is also possible for custom algorithms and projects.
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Dijkstra's Algorithm
With a dream of adding this library to the official Java Collections Framework, I am keeping this project open to contributions ☁️✨. Got an idea for an awesome new feature? Found a bug that's been bugging you? Want to add some witty comments of your own? We'd love to hear from you!
- Fork the repository.
- Create a new branch (git checkout -b feature-branch).
- Make your changes.
- Commit your changes (git commit -am 'Add new feature').
- Push to the branch (git push origin feature-branch).
- Create a new Pull Request.
If you have any questions, or suggestions, or just want to say hi, feel free to reach out:
- Email: kushalv238@gmail.com
- LinkedIn: kushal-vadodaria
Remember, life is just like a graph: complex, intertwined and confusing but there is always a way around it. Sometimes you just need to take a step back (like a breadth-first search) to see the bigger picture, but other times you need to dive deep (like a depth-first search) to uncover the hidden treasures. Happy Graphing! 🚀