graph

Feb 10, 2024

Changes in this version

+ type EmptyCallbacks struct

type Graph

+ func (g *Graph[T]) Load(ids []string, parser NodeParser[T], callbacks LoadCallbacks[T]) error

+ func (g *Graph[T]) RemoveCyclesStartingFromNode(node *Node[T]) []Cycle

+ func (g *Graph[T]) RemoveElementaryCycles() []Cycle

+ type LoadCallbacks interface

+ type NodeParser interface

+ Deps func(node *Node[T]) ([]*Node[T], error)

+ Node func(id string) (*Node[T], error)

+ type NodeParserBuilder func([]string) (NodeParser[T], error)

+ type StdErrCallbacks struct

+ func NewStdErrCallbacks[T any]() *StdErrCallbacks[T]

+ type TestCallbacks struct

+ type TestParser struct

+ Spec [][]int

+ func (t *TestParser) Deps(n *Node[[]int]) ([]*Node[[]int], error)

+ func (t *TestParser) Node(id string) (*Node[[]int], error)

Jan 31, 2024

Changes in this version

type Graph

+ func (g *Graph[T]) GetNodesWithoutParents() []*Node[T]

+ func (g *Graph[T]) RemoveJohnsonCycles() []Cycle

Dec 31, 2023

Changes in this version

+ type Cycle struct

+ Cause [2]string

+ Stack []string

+ type Edge struct

+ func (e *Edge[T]) From() graph.Node

+ func (e *Edge[T]) ReversedEdge() graph.Edge

+ func (e *Edge[T]) To() graph.Node

type Graph

+ func MakeTestGraph(spec map[int][]int) *Graph[int]

+ func (g *Graph[T]) AddFromToEdge(fromId string, toIds ...string) error

+ func (g *Graph[T]) AllNodes() []*Node[T]

+ func (g *Graph[T]) Edge(uid, vid int64) graph.Edge

+ func (g *Graph[T]) From(id int64) graph.Nodes

+ func (g *Graph[T]) FromId(id string) []*Node[T]

+ func (g *Graph[T]) HasEdgeBetween(xid, yid int64) bool

+ func (g *Graph[T]) HasEdgeFromTo(uid, vid int64) bool

+ func (g *Graph[T]) Node(id int64) graph.Node

+ func (g *Graph[T]) RemoveCycles(node *Node[T]) []Cycle

+ func (g *Graph[T]) RemoveFromToEdge(fromId string, toId string)

+ func (g *Graph[T]) To(id int64) graph.Nodes

+ func (g *Graph[T]) ToId(id string) []*Node[T]

type Node

+ func (n *Node[T]) ID() int64

+ type Nodes struct

+ func NewNodesIterator[T any](nodes []*Node[T]) *Nodes[T]

+ func (n *Nodes[T]) Len() int

+ func (n *Nodes[T]) Next() bool

+ func (n *Nodes[T]) Node() graph.Node

+ func (n *Nodes[T]) Reset()

Aug 22, 2023

Changes in this version

+ type Graph struct

+ func NewGraph() *Graph[T]

+ func (g *Graph[T]) AddChild(parent string, children ...string) error

+ func (g *Graph[T]) AddNode(node *Node[T])

+ func (g *Graph[T]) Children(id string) []*Node[T]

+ func (g *Graph[T]) Get(id string) *Node[T]

+ func (g *Graph[T]) Has(nodeId string) bool

+ func (g *Graph[T]) Nodes() []*Node[T]

+ func (g *Graph[T]) Parents(id string) []*Node[T]

+ type Node struct

+ Data T

+ Errors []error

+ Id string

+ func MakeNode(id string, data T) *Node[T]

+ func (n *Node[T]) AddErrors(err ...error)