Near-duplicate tools
Three tools score the same. Only one takes the input you hold. The graph knows which.
Interactive explanation of the planning approach. The current product uses an embedded typed graph, not a embedded graph runtime.

Vector search finds tools that sound right. A graph finds the ones your agent can call, in order.
Three tools score the same. Only one takes the input you hold. The graph knows which.
A PR needs a branch. Nothing in a top-k bag makes one. A path can't have a hole in it.
Similarity returns a bag. Agents need a sequence. The path is the order.
Agents look up the same repo every run. Switchboard skips steps whose output you already have.
Which one? All three score within 0.01.
Only one tool is FED by the Type you hold.
head: branch.name. Nothing in the bag makes one.
A bag. No sequence.
The path is the order.
Every run calls both again to look up acme/api.
Private data, untrusted input, a way out. Seeing the whole plan first is how you refuse it.
See the guardTypes and tools alternate, so a path is a call sequence. One
typedPathSearch
call finds it.
1CALL typedPathSearch({2sourceLabel: 'Type',3sourceProperty: 'name',4sourceValues: ['repo.ref', 'file.path'],5targetLabel: 'Type',6targetProperty: 'name',7targetValues: ['pr.number'],8pairwise: false,9relTypes: ['FEEDS', 'YIELDS'],10relDirection: 'outgoing',11maxLen: 8,12pathCount: 3,13resultLimit: 5014}) YIELD path, pathWeight, pathCost15RETURN path, pathWeight, pathCost16ORDER BY pathWeight ASC
Others walk tool graphs too. Switchboard derives every edge from types, solves the path in one call, and ships as an MCP server.
Search the docs, plan a task, or jump to a page