graph

package

v0.1.66 Latest Latest Go to latest Published: Sep 8, 2026 License: AGPL-3.0 Imports: 1 Imported by: 0

Details

Package graph contains small reusable graph primitives used by Boxy domain models that need explicit dependency traversal.

This section is empty.

This section is empty.

This section is empty.

type DAG[N comparable] struct {
	// contains filtered or unexported fields
}

DAG is a directed acyclic graph with generic node identifiers.

func New[N comparable]() *DAG[N]

func (g *DAG[N]) Add(node N)

func (g *DAG[N]) AddEdge(parent, child N) error

AddEdge adds parent -> child and rejects an edge that would create a cycle.

func (g *DAG[N]) Ancestors(node N) ([]N, error)

Ancestors returns every transitive parent of node once.

func (g *DAG[N]) Parents(node N) []N

Parents returns the direct parents of node. The returned slice is a copy; callers that need stable presentation ordering should sort their node type.