The goal of this project is to implement variations of backtracking based algorithms that assign three colors to every node of a given graph so that no neighbouring nodes have the same color.
TypeScript
0
0
No license
This project implements and visualizes graph coloring algorithms using backtracking techniques to assign three colors to nodes in a graph such that no neighboring nodes share the same color. It's designed for developers and students interested in constraint satisfaction problems and backtracking algorithms, featuring interactive visualizations of classic backtracking, AC-3 backtracking, and backjumping approaches.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies
Support the repos that depend on this repository
Top contributors
TrinhXuanTam
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet
