Skip to content
#

knuth-algorithm-x

Here are 15 public repositories matching this topic...

Optimization solvers in pure Python: LP, MILP, SAT, constraint programming, graph and metaheuristics. No dependencies. Solvor all your optimization needs.

  • Updated Nov 14, 2026
  • Python
knuth-algorithm-x-solver

Knuth Algorithm X Solver, an algorithmic utility designed to solve exact cover problems efficiently using Donald Knuth's Dancing Links technique. It provides a seamless user experience to help programmers and mathematicians compute complex combinatorial solutions, analyze matrix patterns, and solve puzzles like Sudoku.

  • Updated Oct 22, 2026
  • JavaScript

The Knuth-Morris-Pratt (KMP) Algorithm is a string matching algorithm used to find the occurrence of a pattern string in a text string. It uses a preprocessing step to create a failure function, which helps skip irrelevant comparisons and improves its efficiency compared to a simple string matching algorithm.

  • Updated Feb 13, 2023
  • Kotlin

Add this topic to your repo

To associate your repository with the knuth-algorithm-x topic, visit your repo's landing page and select "manage topics."

Learn more