dakera_knowledge_graph
Construct a knowledge graph from a seed memory using embedding similarity to discover how a concept links to stored knowledge.
Instructions
Build a knowledge graph from a seed memory using embedding similarity. Use to explore how a concept connects to stored knowledge. For BFS traversal of an existing linked graph use dakera_graph_traverse.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"agent_id": "<agent_id>",
"memory_id": "<memory_id>"
},
"name": "dakera_knowledge_graph"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| depth | No | Graph traversal depth (controls candidate count) | |
| agent_id | Yes | ||
| memory_id | Yes | Seed memory ID to build graph from | |
| min_similarity | No | Minimum similarity threshold 0.0-1.0 |