Skip to main content
Glama
71,476 servers. Updated

Matching MCP tools:

Matching MCP Connectors:

"Node-RED" matching MCP servers:

  • F
    license
    -
    quality
    C
    maintenance
    Enables retrieval and analysis of graph data from the Pythagraph RED API. Provides detailed graph statistics, node/edge distributions, and formatted table outputs for data visualization and analysis.
  • F
    license
    A
    quality
    D
    maintenance
    MCP server providing tools to search Red Hat KCS solutions, retrieve solution details, search cases, and get case details via Red Hat APIs.
    5
  • A
    license
    A
    quality
    C
    maintenance
    Enables natural language conversations with Spain's electrical grid data through Claude, providing real-time access to electricity demand, generation, prices, and emissions data from Red Eléctrica de España (REE).
    18
    11
    MIT
  • A
    license
    A
    quality
    A
    maintenance
    Enables AI agents to search and retrieve FRED economic time series, including vintage (as-published) data, with tools for series search, observation retrieval, release calendar, revision history, and more.
    9
    MIT
  • A
    license
    A
    quality
    B
    maintenance
    Provides read-only MCP tools for searching and asking over private documents via a local RAG service (reed), returning ranked passages with citations while keeping data on the machine.
    4
    Apache 2.0
  • A
    license
    A
    quality
    B
    maintenance
    Enables fast, low-token code search for AI coding agents via a local BM25 engine built on SQLite FTS5, with support for camelCase, snake_case, and Japanese text. Provides a stateless MCP stdio server and a Hermes adapter for multi-agent environments.
    1
    MIT
  • A
    license
    A
    quality
    D
    maintenance
    Enables AI-driven semantic code search using Windsurf's reverse-engineered SWE-grep protocol to query local codebases with natural language. It executes local search tools like ripgrep and tree-node-cli to return relevant file paths and line ranges to MCP-compatible clients.
    2
    229
    MIT
  • A
    license
    A
    quality
    D
    maintenance
    Enables semantic search over codebases using natural language queries, returning relevant code snippets with source locations. Integrates with Claude Code for automatic codebase exploration.
    1
    1
    MIT
  • A
    license
    A
    quality
    D
    maintenance
    A standalone Node MCP server that provides semantic search, knowledge graph, and vault editing over an Obsidian vault. It runs locally as a single stdio process without requiring an Obsidian plugin for core functionality.
    18
    364
    9
    Apache 2.0
  • A
    license
    A
    quality
    C
    maintenance
    A lightweight MCP server that provides read-only access to Xiaohongshu (Little Red Book) data, enabling search, note details, user profiles, and trending feeds via direct HTTP APIs.
    5
    17
    MIT
  • F
    license
    A
    quality
    B
    maintenance
    Searches Claude Code documentation via BM25 indexing, returning ranked snippets with category filtering. Enables fast, local search over official docs without full-document scans.
    4
  • F
    license
    A
    quality
    C
    maintenance
    An MCP server that searches Xiaohongshu (Little Red Book) for top-liked image-text notes, extracting structured data such as title, content, author, links, and images. It can be used as an MCP tool or CLI for AI workflows.
    1
  • A
    license
    A
    quality
    F
    maintenance
    Enables AI agents to discover and interact with businesses by reading structured NOD manifests. Provides tools to look up business capabilities and check if specific actions like ordering food or booking appointments are supported.
    2
    MIT
  • A
    license
    A
    quality
    D
    maintenance
    Enables AI agents to discover and interact with business capabilities by reading structured nod.json manifests from domains, supporting actions like ordering, booking, and searching.
    2
    MIT