go.bigb.es/auxilia

v0.2.0
Doc Versions Source

Functions

f func ChronologicalSort

src 
func ChronologicalSort[K comparable, T any](g graph.Graph[K, T]) ([]K, error)

f func RecursiveDFSAfter

src 
func RecursiveDFSAfter[K comparable, T any](g graph.Graph[K, T], start K, visit func(K)) error

f func Roots

src 
func Roots[K comparable, T any](g graph.Graph[K, T]) []K

Roots returns a list of all vertices that have no incoming edges.

Source Files