find_all_paths

Find all paths between two entities up to a maximum depth

SERVEREnhanced Knowledge Graph Memory Server SOURCEdanielsimonjr/memory-mcp

Low RISK CLASS

Category Read

Parameters 00 required

Recommended Allowedsee the rule below

Registry record Grade F, identity unverified Pull the record →

This record as markdown: /tools/danielsimonjr-memory-mcp/find-all-paths.md

WHAT IT DOES

What find_all_paths does on Enhanced Knowledge Graph Memory Server

AI agents call find_all_paths to retrieve information from Enhanced Knowledge Graph Memory Server without modifying anything. It is typically the context-gathering step in research, monitoring, and reporting workflows, before the agent takes action elsewhere.

RISK

Why find_all_paths is rated Low

This tool queries the knowledge graph to discover connections between entities. It is a read-only retrieval operation that does not create, modify, delete, or execute any external actions. The maximum depth parameter is a query filter, not a destructive limit. No data is altered, and the operation has no irreversible consequences.

From the tool's definition Tool description states 'Find all paths between two entities up to a maximum depth' — a query operation that retrieves relationship data from the knowledge graph without modification or side effects.

Attacks that exploit this kind of access

RECOMMENDED RULE

The rule that runs find_all_paths safely

PolicyLayer is an MCP gateway: it sits between your AI agents and Enhanced Knowledge Graph Memory Server, and checks every tool call against a rule you set before the call runs. Nothing changes on the server itself. For find_all_paths, this is the rule to start with:

find_all_paths Allowed

find_all_paths is read-only, so it stays allowed. Everything else on the server is denied unless you say otherwise.

View as policy code

policy.json

{
  "version": "1",
  "default": "deny",
  "tools": {
    "find_all_paths": {}
  }
}

ALLOW ONLY THIS TOOL → Instant setup, no code required.

The button opens the PolicyLayer dashboard: create your workspace, connect Enhanced Knowledge Graph Memory Server, apply this rule, and every find_all_paths call is checked against it from then on.

FAQ

Questions about find_all_paths

What does the find_all_paths tool do? +

Find all paths between two entities up to a maximum depth. It is categorised as a Read tool in the Enhanced Knowledge Graph Memory Server MCP Server, which means it retrieves data without modifying state.

How do I enforce a policy on find_all_paths? +

Register the Enhanced Knowledge Graph Memory Server MCP server in PolicyLayer and add a rule for find_all_paths: allow, deny, rate-limit, or require approval. Point your MCP client at the PolicyLayer proxy URL and the rule is enforced on every call, before it reaches Enhanced Knowledge Graph Memory Server. Nothing to install.

What risk level is find_all_paths? +

find_all_paths is a Read tool with low risk. Read-only tools are generally safe to allow by default.

Can I rate-limit find_all_paths? +

Yes. Add a rate_limit block to the find_all_paths rule in your PolicyLayer policy. For example, setting max: 10 and window: 60 limits the tool to 10 calls per minute. Rate limits are tracked per agent session and reset automatically.

How do I block find_all_paths completely? +

Set action: deny in the PolicyLayer policy for find_all_paths. The AI agent will receive a policy violation error and cannot call the tool. You can also include a reason field to explain why the tool is blocked.

What MCP server provides find_all_paths? +

find_all_paths is provided by the Enhanced Knowledge Graph Memory Server MCP server (danielsimonjr/memory-mcp). PolicyLayer sits as a proxy in front of this server to enforce policies before tool calls reach the server.

KEEP EXPLORING

More on Enhanced Knowledge Graph Memory Server, and thousands of servers like it.

This server

All 225 Enhanced Knowledge Graph Memory Server tools →

Across the catalogue

The MCP Attack Database →

Guides

Roll out MCP under one policy →Data exfiltration →MCP token cost →