Sudoku Solver using Graph Coloring

A Python implementation of a Sudoku solver that uses graph coloring concepts from graph theory.

Overview

This project models Sudoku as a graph coloring problem where:

• Each cell in the Sudoku grid is a vertex
• Edges connect vertices that cannot have the same value (same row, column, or 3x3 box)
• Solving Sudoku becomes equivalent to coloring the graph with 9 colors (1-9)

Features

• Graph-based Sudoku representation
• Backtracking with constraint propagation
• Support for standard 9x9 Sudoku puzzles
• Easy-to-use API
• Comprehensive test suite