There are 1 repository under dimacs topic.
Graph grounding for graph coloring algorithms such as Welsh Powell and Evolution algorithms like Harmony Search and Genetic
Implementation of branch and bound algorithm for maximum clique problem
LibMVC is a collection of fast iterative minimum vertex cover solvers. Currently NuMVC and FastVC are implemented.
Results of popular Steiner tree instances
Utilities to parse files in DIMACS format which is the de-facto standard for input to SAT solvers.
A simple theorem prover made for a university programming assignment
Compile MiniSat to WebAssembly using emscripten
Windows builds for The Glucose SAT Solver.
Coverts a generic Verilog netlist into the DIMACS format compatible with many SAT solvers
An implementation of a recursive DPLL solver in OCaml. It parses setup (cnf ) DIMACS and checks if the formula is satisfied.
Compile microsat to WebAssembly using emscripten
A generic SAT solver designed to solve SAT problems in the DIMACS format.
A generator of graphs written in Python and LaTeX
A set of parsers for DIMACS formats written in Prolog
A program which will read a sudoku puzzle from a file (some examples are sudoku1.txt, sudoku2.txt, etc) and generate clauses in the DIMACS format for each sudoku puzzle in the files sudokuN.cnf, where N = 1, 2, ..., 5.
Dijkstra Single Source Shortest Path using Boost
AUTIS library allows parsing combinatorial problem instances for different common formats.
Script para encontrar o caminho mínimo em grafos no formato DIMACS
Copositivity matrix detection using simplices, faces refinement vs Bundfuss bisection
Un projet pour résoudre une grille de Tetravex en utilisant la logique propositionnelle.
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*