React Sigma - Graph Search
Find routes from A to B in a graph.
TypeScript typings for Knowledge Graph Search API v1
Collection of graph search algorithms
Qdrant-backed semantic code-search, AST/symbol graph search, and impact-radius diagrams for Claude Code MCP.
Generic graph search using A* or Dijkstra.
TypeScript typings for Knowledge Graph Search API v1
ctxloom — The Universal Code Context Engine. A local-first MCP server providing intelligent code context via hybrid Vector + AST + Graph search with Skeletonization (92% token reduction).
DataFire integration for Knowledge Graph Search API
SLP Graph Search gRPC interface for node.js clients.
Agent-first CLI for renketsu — context-graph search, ingest, and queries from the terminal.
MCP server for Google's free public Knowledge Graph Search API - search for structured entity information
Acta core — canonical document pipeline (schema, parser, validator, graph, search index, artifacts) for ADR and spec docs-as-code.
For generic graph search: depth-first, breadth-first, ...
A simple wrapper for Google's Knowledge Graph Search API
graph-search
MCP server for email knowledge graph search
Find and load configuration from a package.json property, rc file, TypeScript module, and more!
SLP Graph Search gRPC interface for node.js clients.
DataFire integration for Knowledge Graph Search
SLP Graph Search gRPC interface for node.js clients.
Knowledge Graph Search Module
Traversal functions for graphology.
Simple library to search and traverse graphs using DFS, BFS algorithms, and also detect cycles in directed graph input
This is the simple REST client for Knowledge Graph Search API V1. Simple REST clients are Ruby client libraries that provide access to Google services via their HTTP REST API endpoints. These libraries are generated and updated automatically based on the discovery documents published by the service, and they handle most concerns such as authentication, pagination, retry, timeouts, and logging. You can use this client to access the Knowledge Graph Search API, but note that some services may provide a separate modern client that is easier to use.
Directed Acyclic Graph for Key-Value searches
mvGraph is an implementation of the graph data structure in Ruby. \ It was created to solve some classic AI search problems; as such, it currently supports BFS, DFS, any user-defined heuristic search, as well as A*.
GRATR is a framework for graph data structures and algorithms. This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics. GRATR currently contains a core set of algorithm patterns: * Breadth First Search * Depth First Search * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected
Durable shared knowledge with vector search, concept graph, and expertise tracking
A simple graph manipulation libraryproviding search, rendering (to dot format, etc.)
The gem provides a client for the AllegroGraph 4.x RDF graph database. Features like searching geo-spatial data, type mapping and transactions are supported.
GRATR is a framework for graph data structures and algorithms. This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics. GRATR currently contains a core set of algorithm patterns: * Breadth First Search * Depth First Search * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected
A Ruby object-oriented search library for directed and undirected graphs based loosely on Dijkstra's algorithm
CLI tool that outputs dependency information from a set of Xcode projects with targets thatdepend on each other, it does it by creating a (reverse) dependency graph and doing abreadth-first search.
QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net 2.0 and up. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc... QuickGraph supports MSAGL, GLEE, and Graphviz to render the graphs, serialization to GraphML, etc...
Official Ruby SDK for Supermemory. Add persistent memory to AI applications with document management, semantic search, user profiling, and integrations with ruby-openai, graph-agent, and langchainrb.
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.