dijkstra_path
Find the shortest path between two nodes in a weighted graph (Dijkstra's algorithm).
This record as markdown: /tools/io-github-malamutemayhem-unclick-mcp-server/dijkstra-path.md
What dijkstra_path does on UnClick
AI agents call dijkstra_path to retrieve information from UnClick without modifying anything. It is typically the context-gathering step in research, monitoring, and reporting workflows, before the agent takes action elsewhere.
| Parameter | Type | Required | Description |
|---|---|---|---|
edges | array | Yes | Array of [from, to, weight] triples. |
source | string | Yes | Source node name. |
target | string | Yes | Target node name. |
directed | boolean | — | Treat graph as directed (default false). |
Parameters from the server's own tool schema.
Why dijkstra_path is rated Low
Dijkstra's algorithm is a pathfinding algorithm that computes shortest paths in graphs. It is a stateless read operation that takes graph inputs and returns a path result. No data is created, modified, deleted, or destroyed. No code is executed on external systems. No financial transactions occur. This is a low-risk computation tool suitable for graph analysis queries.
From the tool's definition Tool performs 'Find the shortest path between two nodes in a weighted graph' using Dijkstra's algorithm. This is a pure computational/query operation with no side effects—it retrieves or computes information without modifying any data or triggering external…
Attacks that exploit this kind of access
The rule that runs dijkstra_path safely
PolicyLayer is an MCP gateway: it sits between your AI agents and UnClick, and checks every tool call against a rule you set before the call runs. Nothing changes on the server itself. For dijkstra_path, this is the rule to start with:
dijkstra_path is read-only, so it stays allowed. Everything else on the server is denied unless you say otherwise.
The button opens the PolicyLayer dashboard: create your workspace, connect UnClick, apply this rule, and every dijkstra_path call is checked against it from then on.
Questions about dijkstra_path
Find the shortest path between two nodes in a weighted graph (Dijkstra's algorithm). It is categorised as a Read tool in the UnClick MCP Server, which means it retrieves data without modifying state.
dijkstra_path accepts 4 parameters: edges, source, target, directed. Required: edges, source, target. The full parameter table on this page comes from the server's own tool schema.
Register the UnClick MCP server in PolicyLayer and add a rule for dijkstra_path: 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 UnClick. Nothing to install.
dijkstra_path is a Read tool with low risk. Read-only tools are generally safe to allow by default.
Yes. Add a rate_limit block to the dijkstra_path 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.
Set action: deny in the PolicyLayer policy for dijkstra_path. 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.
dijkstra_path is provided by the UnClick MCP server (@unclick/mcp-server). PolicyLayer sits as a proxy in front of this server to enforce policies before tool calls reach the server.
More on UnClick, and thousands of servers like it.
This server
Across the catalogue