graph

package

v0.20.0 Latest Latest Go to latest Published: Jul 5, 2026 License: MIT Imports: 1 Imported by: 0

Details

Package graph answers reachability questions over the CALLS edge table using depth-capped, cycle-guarded recursive CTEs.

This section is empty.

This section is empty.

func CallPaths(db *sql.DB, from, to int64, maxDepth, limit int) ([][]Node, error)

CallPaths returns up to limit distinct call paths from -> to (each a sequence of nodes), shortest first.

type Node struct {
	ID    int64
	QName string
	Name  string
	Kind  string
	File  string
	Line  int
	Depth int
}

Node is a symbol reached during traversal.

func Callees(db *sql.DB, start int64, maxDepth int) ([]Node, error)

Callees returns symbols transitively called by start, up to maxDepth.

func Callers(db *sql.DB, start int64, maxDepth int) ([]Node, error)

Callers returns symbols that transitively call start, up to maxDepth.