A general pattern-based solver of finite Constraint Satisfaction problems
-
Updated
Jun 13, 2025 - CLIPS
A general pattern-based solver of finite Constraint Satisfaction problems
Solvers for the Selective Graph Colouring Problem and generalisations
Yeah, nah, don't look into alternative_sat
This module has some Advanced concepts and Programs related to Graph Theory in Java with program implementations
A simple sudoku solver made in rust,
Universidad Simón Bolívar - CI2693 - Laboratory Algorithms and Data Structures III - Graph Colouring
A static scheduler using OR-Tools library
Counting Orbits of Graph Colourings
Graph Colouring Problem using Constraint Satisfaction Problem in C
Investigations into the Grundy number of queen graphs
Heuristics for creating casts with the minimum amount of actors.
Contains all my implementations for the weekly lab work of the course 18CSC305J - Artificial Intelligence (in python).
A collection of algorithms for calculating the chromatic number of undirected graphs, including Brute Force, Greedy, DSatur, Backtracking, RLF, 3-SAT, and DFS.
A genetic algorithm solution for the Graph Colouring problem ( P-Complete ~ O(n*2^n) ), as alternative to SIMPLEX method.
Greedy list and greedy list-edge colouring in Python with the listcolouring package.
List colouring of graphs in Python.
Constraint-based list-colouring in Python with vizing.
Code behing a blog post about gvpr.
A command-line interface for Culberson’s colouring programs.
Add a description, image, and links to the graph-colouring topic page so that developers can more easily learn about it.
To associate your repository with the graph-colouring topic, visit your repo's landing page and select "manage topics."