Project Description
The Graph Coloring Problem is a classic optimization challenge where we assign colors to graph vertices such that no two adjacent vertices share the same color.
This project allows users to:
Input custom graphs (nodes & edges)
Choose between two powerful AI algorithms:
Backtracking
Genetic Algorithm
Visualize the coloring process in a user-friendly UI
View performance metrics like time and fitness evolution
Algorithms Used
1. Backtracking Search Algorithm
Systematically explores possible colorings
Uses recursive depth-first traversal
Backtracks upon conflicts
2. Genetic Algorithm
Inspired by natural evolution
Represents solutions as chromosomes
Applies crossover, mutation & selection
Tracks fitness (conflict minimization) over generations
