Search Results for "backtracking"
Sort By:
Showing 31 open source projects for "backtracking"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
RE2/J
linear time regular expression matching in Java
RE2/J is a high-performance regular expression engine implemented in pure Java as a port of Google’s C++ RE2 library. Unlike traditional regex engines such as Java’s java.util.regex, PCRE, or Perl’s implementation—which rely on backtracking and can suffer from catastrophic exponential runtimes—RE2/J guarantees linear-time matching relative to input size. It achieves this efficiency by simulating all possible matches in a single pass using a nondeterministic finite automaton (NFA), ensuring predictable and safe performance even with complex patterns. This makes RE2/J ideal for applications that must handle user-supplied regular expressions securely without the risk of denial-of-service through regex backtracking. ... -
2
re2
Alternative to backtracking regular expression engines
RE2 is a fast, safe, thread-friendly alternative to backtracking regular expression engines like those used in PCRE, Perl, and Python. It is a C++ library. This is the source code repository for RE2, a regular expression library. There is a fair amount of documentation (including code snippets) in the re2.h header file. Unless otherwise noted, the RE2 source files are distributed under the BSD-style license found in the LICENSE file. -
3
Angstrom
Parser combinators built for speed and memory efficiency
Angstrom is a parser-combinator library in OCaml designed for high-performance applications. It provides monadic and applicative interfaces for composing parsers and supports incremental input processing. -
4
LeetCode Book
Comprehensive study guide for coding interviews
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. ... -
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
5
Fast Sudoku Solver
C source for a fast backtracking Sudoku solver.
C source for a fast backtracking Sudoku solver. Console interface, non-graphic, accepts files with multiple games. Can solve 10,000 Sudokus in under a minute. New version is 5% faster! :) -
6
qMazeGen
a maze generator
A 3D OpenGL maze generator with 3 algorithms : PRIM, KRUSKAL, BACKTRACKING written with Qt -
7
The Unicon Project
A modern descendant of the Icon programming language.
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. -
8
Burn To The Brim
Utility for efficiently grouping files and folders together
**Burn To The Brim** is a highly efficient archiving utility designed to solve the classic subset-sum (bin packing) optimization challenge. It intelligently selects and groups files and directories (documents, high-fidelity media, or raw back-ups) to optimally fill recordable Blu-Rays, USB drives or custom-capacity storage drives. By recursively scanning your designated folders, BTTB matches item sizes to your media capacity, finding a near-perfect selection in milliseconds and an... -
9
WRVM
A weakly reversible Forth for Linux (Intel) platforms
A weakly reversible Forth virtual machine supporting backtracking and related features, Used to support research into the semantics and programming structures of weakly reversible languages. -
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
10
soulng
Lexer and parser generator tool for C++
...The spg tool takes .parser files that contain descriptions of parsers as input and produces C++ source code for parser classes as output. The parser generator produces a recursive descent top-down backtracking parser that use the lexical analyzer generated by slg to tokenize the input. -
11
Repo of Tree of Thoughts (ToT)
Implementation of "Tree of Thoughts
...ToT allows LMs to perform deliberate decision-making by considering multiple different reasoning paths and self-evaluating choices to decide the next course of action, as well as looking ahead or backtracking when necessary to make global choices. -
12
Djot
A light markup language
Djot is a light markup syntax. It derives most of its features from commonmark, but it fixes a few things that make commonmark's syntax complex and difficult to parse efficiently. It is also much fuller-featured than commonmark, with support for definition lists, footnotes, tables, several new kinds of inline formatting (insert, delete, highlight, superscript, subscript), math, smart punctuation, attributes that can be applied to any element, and generic containers for block-level,... -
13
From PEG to a practical parser
Transcribe Parsing Expression Grammar into a parser written in Java.
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. ... -
14
Pytholog
A logic programming tool and a logical database with a RESTful API
Pytholog Tool (Command line & API) An executable tool, built in python, that enables logic programming and prolog syntax through interactive shell that mimics prolog language and / or RESTful API that can be called from other applications. The tool is based on the python library pytholog which can be found here: https://github.com/mnoorfawi/pytholog The tool starts normally from the command line. Let's look at the arguments that can be specified while initiating the tool: $... -
15
Sudoku command line solver
Solve 9x9 Sudoku Puzzles Using A Command Line Utility
This tool written in C uses the Backtracking algorithm to solve Sudoku puzzles. The idea was born by participating a coding challenge of a German internet forum. https://www.coding-board.de/threads/coding-herbst-die-coding-board-de-coding-challenge.39297/ So it's rather made for fun. However, this code won in terms of speed. Unfortunately, the initiator of the contest has passed away in the meantime. -
16
squirrel USB
make multi-boot windows USB key
...COPY CONENTS OF ISO to new partion. 10. boot syslinux 11. boot grub 12. run iso goo.gl/7sVxts A working version with a Mini Windows 10 is in the files section. <3 WARNING NOTE: Make sure the usb disk is for squirrel usb only. lol delete. reformat. $5 etc. Any backtracking will become horridly confused to spoils! Editing the menu by booting the example entries may not be toothsome. Edit files carefully -
17
Nigma
A CDCL SAT solver with partial backtracking
-
18
LillyTab
Another free OWL/DL Reasoner
LillyTab is a modular description logic consistency checker (reasoner) with support for a subset of OWL/DL. -
19
It is a C# library that implementes eight backtracking algorithms, which include Knapsack algorithm, BTKnapsack algorithm, Circles algorithm, Loading algorithm, LoadingWithIteration algorithm, Queen algorithm, NQueenWithIteration algorithm and Stamps algorithm.
-
20
JConstraints
Java Framework to implement solutions to solve constraints problems
...Therefore, with few interfaces implementations you can already run advanced combinatory solutions. Just to name a few algorithms, the Framework can solve any constraints problems using: - Regular Backtracking; - A variety of Backjumping algorithms; - A variety of arc-consistency algorithms; - Local search algorithm; - Tabu search algorithm; - Maximize solutions: comming soon; - Minimize solutions: comming soon; The Framework also enables heuristic injections so that the developers can achieve greater performance of algorithms using their own heuristics. ... -
21
Sudoku Solver 1.0
Sudoku Solver 1.0 solves 9x9 Sudokus.
Sudoku Solver 1.0 solves 9x9 Sudokus almost instantly. It uses deductions along with backtracking. -
22
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
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). ... -
23
Large Scale Optimization Templates
C++ templates with generic nonlinear optimization algorithms
Highly tunable, simple to use collection of the templates, containing a set of classes for solving unconstrained large scale nonlinear optimization problems. Currently it contains: -- Limited Memory Quasi Newton (L-BFSG) -- BFSG -- Conjugate Gradient -- Gradient Descent -- Wolf condition Line Search -- Backtracking Line Search -- Exact Golden Search -- Golden Search with Wolf condition We also distribute a set of tests with the library. -
24
Exact Subgraph Matching Algorithm
Exact Subgraph Matching Algorithm for Dependency Graphs
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. ... -
25
The LALR parser generator (LPG) is a tool for developing scanners and parsers written in Java, C++ or C. Input is specified by BNF rules. LPG supports backtracking (to resolve ambiguity), automatic AST generation and grammar inheritance.