Additional ESLint's rules for Node.js

AI-powered natural language end-to-end testing framework

Get the shortest leading whitespace from lines in a string

Compare items in two sequences to find a longest common subsequence

Native Linux ARM64 runtime for the embeddable IronGraph graph database and automatic local embeddings.

excalibur-pathfinding provides ability to use A* and Dijkstra's Algorithm for pathfinding and with Excalibur.js

LavaMoat's secure package naming convention

Computes the K shortest paths in a graph from node s to node t using Yen's algorithm

Simple module to add additional directories to the Node module search for top-level app modules

Deterministic, allocation-free 2D pathfinding for ExoJS: A*, jump-point search, weighted grids and waypoint graphs.

__Custom edge that avoids crossing nodes__

Library for creating orthogonal connectors with pathfinding support

Microsoft Graph Client Library

JavaScript and React client for an embeddable graph database with automatic local embeddings and vector search.

A module for the search backend that implements search using PostgreSQL

Dijkstra algorithm optimized with priority queue.

Highlight keywords using JavaScript. Intended for every use case. Can e.g. be used to mark text in search results.

Compare items in two sequences to find a longest common subsequence

Generic synchronous A* search algorithm

Complete WASM toolkit for edge AI: vector search, graph DB, neural networks, DAG workflows, SQL/SPARQL/Cypher, and ONNX inference - all running in browser