"A tool or software for generating graphs" matching MCP servers:

MCP server that routes natural language requests to structured tool calls using a LoRA-tuned small language model, with built-in validation, retry, and fallback recovery.

Enables AI coding agents to request a second opinion from a different frontier model via a single tool call, with PII scrubbed before transit, live web search, and support for Claude, ChatGPT, Cursor, and Gemini.

Enables AI agents to control a Playwright-driven browser through natural-language instructions, including page interaction and live browser task execution.

Enables AI agents to request an independent second opinion from a different frontier model, with PII scrubbing before transit, live web search grounding, caching, and multi-provider failover.

A configurable MCP gateway that runs multiple Streamable HTTP MCP servers and exposes all their tools through a single endpoint, enabling tool aggregation and routing for MCP clients.

A framework for building hot-loadable MCP tools that feature conversational negotiation, graduated permissions, and zero-downtime updates. It enables persistent state continuity across server restarts and provides a hypothetical evaluation system for tool actions.

An MCP proxy that embeds tool definitions and returns only the top-k semantically relevant tools per query, reducing context usage and routing calls to upstream MCP servers.

Central registry for AI tools with vector search and knowledge graph, enabling intelligent tool discovery, chaining, and execution via MCP.

Graph-based tool retrieval for LLM agents. Builds a tool graph from OpenAPI/MCP specs and retrieves multi-step workflows via hybrid search (BM25 + graph traversal + embedding), recovering accuracy from 12% to 82% with 79% fewer tokens. Also works as an MCP Proxy to aggregate multiple servers behind 3 meta-tools.

A single MCP server that provides dynamic access to thousands of APIs through discovery and proxy, eliminating the need to install and configure multiple separate MCP servers.

Enables centralized proxy and orchestration of MCP servers, providing unified tool discovery, authentication, and secure request routing. It adds a human-in-the-loop approval gate for high-risk actions and audit logging.

Enables ZCode to control a real Chrome browser, including tabs, navigation, page content, clicks, form filling, keyboard input, scrolling, screenshots, and JavaScript evaluation through a local MCP bridge.

Enables declaring a catalog of tools for LLMs, filtering them by role, validating arguments, guarding sensitive calls with server-side confirmations, and recording an audit log.

Enables OpenAI-compatible clients to access external tools, APIs, repositories, and data sources through MCP with allowlisting, approval, and argument validation, deployable as a FastAPI service or Python library.

Enables agents to send only the handful of tool definitions relevant to each question, ranking a large catalog by keywords and optional embeddings to cut context cost and wrong-tool picks. It can also run in front of any mcpServers config as a proxy that exposes just search_tools and call_tool instead of the whole catalog.

Routes external MCP tools behind a small on-demand discovery interface for Codex agents, using Jev to select relevant tools and providing fallback to the full inventory when confidence is low.

Enables locally configured MCP servers to be called over stdio and mixed with xAI server-side tools, without relying on hosted xAI MCP.

Enables AI agents to securely discover, invoke, and manage tools through a hardened MCP endpoint with protections like injection detection, circuit breakers, retry backoff, response caching, context-window limiting, and state snapshots.

Lets a human review what an AI agent is about to post to a chat tool (Slack first) before it is sent. Renders the draft, destination and warnings (@here/@channel, unresolved mentions, format issues) in a neutral local HTML preview; never sends anything.

Analyzes multi-step AI agent tool chains to compute success probability, identify bottlenecks, and suggest better execution orders, enabling more reliable agents via local pure-math computation.