Ingresa una cadena A, cadena B y cadena C, busca en la cadena A todas las coincidencias de la cadena B y lo reemplaza por la cadena C
-
Updated
Jun 22, 2017 - C++
Ingresa una cadena A, cadena B y cadena C, busca en la cadena A todas las coincidencias de la cadena B y lo reemplaza por la cadena C
Smart Metro is a modular C++-based Delhi Metro simulator using algorithms like Dijkstra, SJF, Ford-Fulkerson, and more. It features shortest paths, ticket verification, scheduling, and admin tools—all via CLI.
Super efficient parallel implementation of dynamic dictionary matching
Lab program for ADA Lab
A very fast new family of string matching algorithms based on hashing q-grams.
Algorithms
A C++ Implementation of the Aho-Corasick pattern matching algorithm.
Strings Heuristic Analyzer (Tool to detect suspected strings via regexp matching)
Program to search words from a 2D array word puzzle in C++. Implemented the string searching pattern from scratch
C++ functions to judge the similarity of strings. Originally created to correct messy human input. Also compiles to Web Assembly.
A lightweight, header-only C++ library to search a text in all the text files in directory or it's subdirectories.
A comparative C++ toolkit for wildcard string matching.
A calculator program that takes in an equation as a string and returns the output.
Simple "glob" pattern matching.
Add a description, image, and links to the string-matching topic page so that developers can more easily learn about it.
To associate your repository with the string-matching topic, visit your repo's landing page and select "manage topics."