Method graphNeighborsText

cli/knowledge_graph.go:230–258

graphNeighborsText renders the local graph (backlinks + related notes) of the node best matching idOrQuery, for @memory neighbors. Free text resolves to the best-matching node, so the model can pass a subject rather than a node id.

(idOrQuery string)

// node best matching idOrQuery, for @memory neighbors. Free text resolves to the
// best-matching node, so the model can pass a subject rather than a node id.
func (cli *ChatCLI) graphNeighborsText(idOrQuery string) (string, error) {
	g := cli.buildKnowledgeGraph()

	seed, ok := g.Node(idOrQuery)
	if !ok {
		if hits := g.Search(strings.Fields(idOrQuery), 1); len(hits) > 0 {
			seed = hits[0]
		}
	}
	if seed == nil {
		return i18n.T("graph.tool.no_node", idOrQuery), nil
	}

	hood := g.Neighborhood(seed.ID, graphHoodHops, graphHoodLimit)
	var b strings.Builder
	fmt.Fprintf(&b, "Local graph of %q (%s):\n", strings.TrimSpace(seed.Title), seed.ID)
	if seed.Summary != "" && seed.Summary != seed.Title {
		fmt.Fprintf(&b, "  · %s\n", truncateForLog(seed.Summary, 200))
	}
	if len(hood) == 0 {
		b.WriteString("  (no connected notes yet)")
		return b.String(), nil
	}
	b.WriteString("Connected:\n")
	for _, n := range hood {
		writeGraphNode(&b, n)
	}
	return strings.TrimRight(b.String(), "\n"), nil
}

func writeGraphNode(b *strings.Builder, n *knowledge.Node) {
	title := strings.TrimSpace(n.Title)