graph-recall

Expand memory entries via semantic vector seeds and graph-neighbor recall.

3|1|Updated Jun 24, 2026
One-click install
npx skills add https://github.com/spqian/dreamweave --skill graph-recall
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: graph-recall
Source: https://github.com/spqian/dreamweave/tree/main/skills/graph-recall
Command: npx skills add https://github.com/spqian/dreamweave --skill graph-recall

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes scripts (resource) components.

What problem does it solve?

This Skill addresses the limitations of flat memory lookups by providing a graph-based search and neighbor expansion for enhanced memory recall.

Core Features & Use Cases

  • Graph-Enhanced Recall: Expand memory entries via semantic vector seeds and graph-neighbor recall.
  • Tiered Memory Structure: Utilizes a three-tier memory model (instinct, recall, archive) for efficient data management.
  • Use Case: When querying for information related to people, systems, incidents, or dates, this skill can provide a more comprehensive and connected recall experience compared to traditional flat memory lookups.

Quick Start

Run the graph-recall skill with the query 'last week's project updates'.

Frequently Asked Questions about graph-recall

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How does graph-based vector search improve memory recall over flat lookups?

Graph-based memory recall improves flat lookups by using semantic vector seeds and neighbor expansion to find connected information. It provides a comprehensive retrieval experience by mapping relationships between people, systems, and incidents.

What is the three-tiered memory structure used for data retrieval?

The three-tiered memory structure models data using instinct, recall, and archive tiers. This approach manages complex memory structures efficiently, enabling in-depth analysis and targeted data retrieval for analytical workflows.

How do I retrieve connected information for past project updates?

To retrieve connected project updates, execute a query using graph-based vector search. The system expands memory entries via semantic seeds and graph neighbors, returning comprehensive and related context.

When should I use graph search instead of traditional flat memory lookups?

Use graph search instead of flat memory lookups when querying complex relationships involving people, systems, incidents, or dates. It is designed for administrative and analytical workflows requiring in-depth, connected memory analysis.

Does graph memory recall require external dependencies to function?

No, graph memory recall operates without external dependencies. It leverages an internal three-tiered approach and scripts to process complex memory structures and deliver enhanced vector search results.

What are the limitations of using neighbor expansion for memory analysis?

Neighbor expansion is limited to analyzing structured memory tiers of instinct, recall, and archive. It is designed specifically for administrative and analytical workflows rather than unstructured flat data retrieval.