GraphAlgorithms is a Java project implementing various graph algorithms. It aims to provide efficient and easy-to-understand implementations for educational purposes as well as practical applications.
- Implementation of fundamental graph algorithms.
- Easy-to-use interfaces for adding and manipulating graphs.
- Comprehensive documentation for each algorithm.
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Prim's Minimum Spanning Tree Algorithm
- Kruskal's Minimum Spanning Tree Algorithm
- Java Development Kit (JDK) 8 or higher
- Clone the repository:
git clone https://github.com/Uttam-Mahata/GraphAlgorithms.git
- Navigate to the project directory:
cd GraphAlgorithms - Build the project using Maven:
mvn clean install
- Create a new Java class in the appropriate package.
- Implement the algorithm following the structure of existing classes.
- Update the documentation to include your new algorithm.
Contributions are welcome! Please fork the repository and create a pull request with your changes.
For any questions or suggestions, please open an issue or contact the repository owner.