graph

package

v0.2.0 Latest Latest Go to latest Published: Oct 11, 2026 License: MIT Imports: 4 Imported by: 0

Details

Package graph implements deterministic queries over evidence-bearing snapshots.

This section is empty.

This section is empty.

This section is empty.

type Graph struct {
	Nodes map[string]model.Node
	Edges []model.Edge
	// contains filtered or unexported fields
}

func New(s model.Snapshot) (*Graph, error)

func (g *Graph) Distances(start, kind string, reverse bool, maxDepth int) []Hop

Distances runs a breadth-first traversal from start, optionally limited to maxDepth hops (0 means unlimited). start itself is not included.

func (g *Graph) Mermaid() string

func (g *Graph) Reachable(start, kind string, reverse bool) []model.Node

Reachable follows only recorded edges, never infers runtime reachability.

func (g *Graph) Resolve(query, kind string) []model.Node

Resolve finds entities for a human query: an exact ID, a "path#qualified" suffix, a repository path, or a case-insensitive name/qualified-name match.

func (g *Graph) Select(kind, name string) []model.Node

type Hop struct {
	ID    string `json:"id"`
	Depth int    `json:"depth"`
	Via   string `json:"via,omitempty"`
}

Hop is a node reached by traversal with its distance and predecessor.