Method Neighbors

pkg/knowledge/graph.go:162–175

Neighbors returns the adjacent nodes ordered by edge weight (desc), then ID (asc) for stability.

(id string)

// Neighbors returns the adjacent nodes ordered by edge weight (desc), then ID
// (asc) for stability.
func (g *Graph) Neighbors(id string) []Neighbor {
	adj := g.adj[id]
	out := make([]Neighbor, 0, len(adj))
	for nid, w := range adj {
		out = append(out, Neighbor{ID: nid, Weight: w})
	}
	sort.Slice(out, func(i, j int) bool {
		if out[i].Weight != out[j].Weight {
			return out[i].Weight > out[j].Weight
		}
		return out[i].ID < out[j].ID
	})
	return out
}

// Hubs returns the most connected nodes (weighted degree, then intrinsic
// weight, then ID), capped at limit. Hubs are the backbone of the index card.