The project implements methodologies to solve some fundamental graph theory puzzles with its graphical visualisation for better understanding.
It covers:
- Euler path finder
- Hamiltonian path finder
- The Cover
- Match along with the color that may be helpful in solving the puzzles.
It has been implemented in C language to perform above said functions and thoroughly verified through the set of assumed examples. The purpose of the project is to enable the graphical problem to be solved in smallest of complexities.