Local semantic code graph for AI agents. Adds codebase-aware MCP tools (search, dependencies, architecture map) to Claude Code, Cursor, Windsurf, and Codex — runs entirely on your laptop, no API keys, no cloud.
MCP server for Talon multi-model data engine — SQL, KV, Vector, TimeSeries, MQ, FTS, GEO, Graph, AI
To run the program : * First install all dependencies with ```npm install``` * Then build the program with Run 'LuccaDevises converter.txt' to launch the program on converter.txt file. ALl files will be compiled from ts to js files in bin/ folder.
Pathfinding library for calculating all node pairs' shortest paths in an unweighted undirected graph.
A Rust library for shortest path finding algorithms, including Dijkstra's, A*, and Bellman-Ford. Supports both directed and undirected graphs, with customizable heuristics and edge weights. Ideal for game development, network routing, and graph analysis.
A Rust library for finding shortest paths in weighted graphs using Dijkstra's algorithm with multiple heap implementations
contains data structures used within the icentral system for counting all pairs shortest paths
Fast shortest path calculations on directed graphs made possible by pre-processing the graph using Contraction Hierarchies
A simple Floyd-Warshall algorithm implementation
A shortest-path index for bidirected graphs based on the SPQR decomposition.
Library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs).
Shortest Path is an experimental library finding the shortest path from A to B.
The BMSSP algorithm
A Rust library for building and querying knowledge graphs using SQLite as the backend, with graph algorithms, vector search, and RAG support
Geometric network analysis using Clifford algebra and tropical algebra
A* ruby implementation to find shortest path and map
ruby gem for finding shortest path
Provides a simple way to find the shortest path in a graph of Rails records using Floyd's algorithm
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.