A general pattern-based solver of finite Constraint Satisfaction problems
-
Updated
Nov 12, 2024 - 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 static scheduler using OR-Tools library
A simple sudoku solver made in rust,
Heuristics for creating casts with the minimum amount of actors.
A genetic algorithm solution for the Graph Colouring problem ( P-Complete ~ O(n*2^n) ), as alternative to SIMPLEX method.
Graph Colouring Problem using Constraint Satisfaction Problem in C
Simón Bolívar University - CI2693 - Laboratory Algorithms and Data Structures III - Graph Colouring
Contains all my implementations for the weekly lab work of the course 18CSC305J - Artificial Intelligence (in python).
Generate a logic problem. Model it as a binary constraint satisfaction problem (CSP). Choose a backtracking search algorithm. Watch the CSP get solved.
A command-line interface for Culberson’s colouring programs.
Code behing a blog post about gvpr.
List colouring of graphs in Python.
Greedy list and greedy list-edge colouring in Python with the listcolouring package.
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."