Search Results for "backtracking"

LeetCode-Book is a comprehensive study guide for coding interviews that consolidates algorithm patterns, data-structure templates, and worked LeetCode solutions. It organizes problems by topic—arrays, linked lists, stacks/queues, trees/graphs, dynamic programming, greedy, backtracking, and math—so you can study systematically. Explanations are concise but intentional, highlighting why a pattern fits, how to reason about boundary cases, and the time/space trade-offs. Many entries include template code and “swap-in” variations, helping you recognize how the same technique adapts across similar problems. The book also emphasizes problem-solving habits like deriving invariants, choosing appropriate data structures, and verifying with small counterexamples. ...

Unicon is a very high level object-oriented network- and graphics-savvy programming language with a syntax similar to Pascal or C. Goal-direction, backtracking, patterns and novel data structures make Unicon ideal for rapidly solving complex problems.

Tool to transcribe Parsing Expression Grammar into a parser written in Java. Parsing Expression Grammar (PEG) is a way to specify recursive-descent parsers with limited backtracking. The use of backtracking lifts the LL(1) restriction usually imposed by top-down parsers. In addition, PEG can define parsers with integrated lexing. Unlike some existing parser generators for PEG, the tool does not produce a complex and storage-hungry "packrat parser", but a collection of transparent recursive procedures. ...

LillyTab is a modular description logic consistency checker (reasoner) with support for a subset of OWL/DL.

The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). ...

The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue association detection and Protein-Protein interaction identification. ...

JSudoku is a Java version of the game Sudoku. A backtracking algorithm cares for random puzzles and based on the Sudoku-Puzzle JavaScript. Optionally, JSudoku generates X-Sudoku puzzles.

During a course at University "La Sapienza" in Rome I developed a fully working SAT solver based on unit propagation and backtracking; it can read DIMACS files and process cnf formulas of any length(there are no restrictions on the number of literals).

The horn++ library allows you to solve logical expressions in C++. The expressions must be transformed to horn clauses, which can be written as C++ expressions. The solver uses backtracking to find a solution for the logical problem.

CrossBOT is an open source crossword construction system that features an advanced "stand alone" crossword compiler, based on consistency and intelligent backtracking algorithms, along with a web interface.

The backtracking extension to the EPANET hydraulic modeling toolkit

This project pretends solved Distributed Constraint Satisfaction Problems (Dis-CSP) using Mozart-OZ. Asynchronous Backtracking algorithm will be implemented.