Graph grounding for graph coloring algorithms such as Welsh Powell and Evolution algorithms like Harmony Search and Genetic
-
Updated
Feb 29, 2024 - TypeScript
Graph grounding for graph coloring algorithms such as Welsh Powell and Evolution algorithms like Harmony Search and Genetic
Bosphorus, ANF simplifier and solver, and ANF-to-CNF converter
Projeto criado para disciplina Inteligência Artificial, Com objetivo de calcular uma rota entre os dois pontos usando os seguintes algoritmos: ○ Busca em Largura ○ Busca em profundidade (podendo ser o limitado) ○ Busca de custo uniforme ○ A*
CGen is a tool for encoding SHA-1 and SHA-256 hash functions into CNF in DIMACS format, also into ANF polynominal system in PolyBoRi output format.
a collection of benchmarks (in DIMACS format) for various NP-Complete problems
LibMVC is a collection of fast iterative minimum vertex cover solvers. Currently NuMVC and FastVC are implemented.
Script para encontrar o caminho mínimo em grafos no formato DIMACS
An implementation of a recursive DPLL solver in OCaml. It parses setup (cnf ) DIMACS and checks if the formula is satisfied.
Windows builds for The Glucose SAT Solver.
A diabolic implementation of mcSAT 😈
Un projet pour résoudre une grille de Tetravex en utilisant la logique propositionnelle.
Dijkstra Single Source Shortest Path using Boost
Genetic Algorithm for the Maximum Clique Problem
Compile microsat to WebAssembly using emscripten
Add a description, image, and links to the dimacs topic page so that developers can more easily learn about it.
To associate your repository with the dimacs topic, visit your repo's landing page and select "manage topics."