Search results
173 packages found
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.
Javascript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree(BST), AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max
- data
- structure
- structures
- data structure
- datastructure
- data-structure
- data structures
- datastructures
- data-structures
- in data structures
- in data structure
- binary
- depth
- breadth
- View more
An implementation of the Aho-Corasick algorithm in TypeScript.
Directed Graph. Javascript & Typescript Data Structure.
- Directed Graph
- directed graph
- directedgraph
- directed-graph
- directed
- Directed
- digraph
- javascript
- java script
- JavaScript
- js
- typescript
- type script
- TypeScript
- View more
Graph. Javascript & Typescript Data Structure.
- Graph
- graph data structure
- javascript
- java script
- JavaScript
- js
- typescript
- type script
- TypeScript
- ts
- vertex
- Vertex
- node
- Node
- View more
Undirected Graph. Javascript & Typescript Data Structure.
- Undirected Graph
- undirected graph
- undirectedgraph
- undirected-graph
- undirected
- Undirected
- javascript
- java script
- JavaScript
- js
- typescript
- type script
- TypeScript
- ts
- View more
Library for implementing various algorithms
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
A powerful and flexible text search library for JavaScript that enables you to build a simple text search engine.
- search
- text-search
- query
- query-parser
- parser
- tokenizer
- interpreter
- AST
- abstract-syntax-tree
- boolean-search
- evaluation
- normalization
- factory
- search-engine
- View more
Data Structures and Algorithms
An implementation of DFS algorithm with simple usage.
Binary search tree data structure library for JavaScript
iterative deepening depth-first search (IDDFS) for JavaScript
General purpose BFS implementation.
Algorithms and data structures for Node
Simple search suggestion using the Levenshtein distance algorithm.
High-performance 2D spatial index for rectangles (based on R*-tree with bulk loading and bulk insertion algorithms)
Given a name and a list of names that are not equal to the name, return a spelling suggestion if there is one that is close enough.
- spelling-suggestion
- spelling
- suggestion
- levenshtein
- leven
- compare
- algorithm
- match
- matching
- search
- comparison
- similarity
- similar
- diff
[](https://github.com/wise-introvert/deepsearchjs/workflows/npm-publish.yml) [![test](https://github.com/wise-introvert/deepsearchjs/actions/workflows/test
- typescript
- library
- json
- object
- search
- nested
- deep
- keys
- keywords
- utility
- functionality
- api
- searching
- optimization
- View more