Skip to main content
Glama

find_path

Find the shortest path between two nodes in a knowledge graph using BFS algorithm to analyze connections and relationships.

Instructions

두 노드 사이의 최단 경로를 BFS로 탐색한다.

Input Schema

TableJSON Schema
NameRequiredDescriptionDefault
startYes시작 노드 이름 또는 ID
endYes도착 노드 이름 또는 ID

Output Schema

TableJSON Schema
NameRequiredDescriptionDefault
resultYes
Behavior2/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

No annotations are provided, so the description carries the full burden of behavioral disclosure. It mentions the algorithm (BFS) but doesn't describe performance characteristics (e.g., time complexity for large graphs), what happens if no path exists, or output format details. For a path-finding tool with zero annotation coverage, this is a significant gap in transparency.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness5/5

Is the description appropriately sized, front-loaded, and free of redundancy?

The description is a single, efficient sentence in Korean that directly states the tool's function without unnecessary words. It is front-loaded and wastes no space, making it easy for an agent to parse quickly.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness3/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

Given the tool's complexity (graph path-finding), the description is minimal. It lacks details on output (though an output schema exists, which helps), error handling, and behavioral traits. With no annotations and a simple input schema, the description is adequate but leaves gaps in understanding how the tool behaves in edge cases.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters3/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

The schema description coverage is 100%, with clear descriptions for both parameters ('start' and 'end' nodes). The description adds no additional parameter semantics beyond what the schema provides, such as node format examples or constraints. Since the schema does the heavy lifting, the baseline score of 3 is appropriate.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose4/5

Does the description clearly state what the tool does and how it differs from similar tools?

The description clearly states the tool's purpose: '두 노드 사이의 최단 경로를 BFS로 탐색한다' (finds the shortest path between two nodes using BFS). It specifies the verb (탐색한다/finds), resource (경로/path), and algorithm (BFS). However, it doesn't explicitly differentiate from sibling tools like 'causal_chain' or 'explain_node', which might also involve path-related operations in a graph context.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines2/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

The description provides no guidance on when to use this tool versus alternatives. It doesn't mention sibling tools or contexts where BFS might be preferred over other algorithms, nor does it specify prerequisites or exclusions. The agent must infer usage from the tool name and description alone.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

Install Server

Other Tools

Latest Blog Posts

MCP directory API

We provide all the information about MCP servers via our MCP API.

curl -X GET 'https://glama.ai/api/mcp/v1/servers/mengro1102/brainforge-mcp'

If you have feedback or need assistance with the MCP directory API, please join our Discord server