graph

Oct 10, 2023

Changes in this version

+ func DFSAll(g Graph, enter, exit func(Node))

+ func DebugString(g Graph) string

+ func OutDegree(g Graph, n Node) int

+ func PerEdge(g Graph, fn func(e Edge))

+ type Edge struct

+ Dst Node

+ Src Node

+ type Graph interface

+ NodeLimit func() int

+ PerNode func(func(n Node))

+ PerOutEdge func(src Node, fn func(e Edge))

+ func NewAdjacencyGraph(nodes []Node, edges []Edge) Graph

+ type Node int

+ func PostOrder(g Graph) []Node

+ func ReversePostOrder(g Graph) []Node