This project addresses one of the most challenging problems in Graph Theory, the Graph Isomorphism Problem. The goal of this project is to conduct intensive research and implement efficient algorithms that enhance the capabilities of the open-source Graph4J library.
To tackle this complex problem, we have focused on implementing and integrating advanced algorithms:
- VF2 Algorithm: Designed for general graphs.
- AHU Algorithm: Specialized for trees.
These algorithms were incorporated into the [Graph4J] library, and a Java Swing GUI was developed to facilitate the creation, editing, and testing of graphs for isomorphism. Additionally, a performance comparison was conducted against similar algorithms from other libraries such as JGrapht and NetworkX, showing superior efficiency in both time and space complexity.
Algorithms : [Explore the implemented algorithms]
The research paper provides a comprehensive overview of the methodologies, implementations, and performance evaluations conducted during this project.
- File: Read the paper here
- Grade: 10/10
- Graph4J Repository: Graph4J on GitHub
- Forked Repository with Complete Code: My Complete Code
Thank you for your interest!