graph

package

v0.1.1 Latest Latest Go to latest Published: Apr 19, 2026 License: MPL-2.0 Imports: 5 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type Graph[T comparable] struct {
	// contains filtered or unexported fields
}

func NewGraph[T comparable]() *Graph[T]

func (g *Graph[T]) AddEdge(from, to string) error

func (g *Graph[T]) AddNode(id string, data T) error

AddNode adds a node to the graph with the given ID and data. Returns an error if a node with the same ID already exists.

func (g *Graph[T]) AddNodes(nodes map[string]T) error

AddNodes adds multiple nodes to the graph. Returns an error if any node with the same ID already exists.

func (g *Graph[T]) EdgeCount() int

func (g *Graph[T]) GetChildren(id string) []string

func (g *Graph[T]) GetNode(id string) (T, bool)

func (g *Graph[T]) GetNodes() map[string]T

func (g *Graph[T]) GetParents(id string) []string

func (g *Graph[T]) HasCircularDependency() bool

func (g *Graph[T]) HasEdge(from, to string) bool

func (g *Graph[T]) HasNode(id string) bool

func (g *Graph[T]) IsEmpty() bool

func (g *Graph[T]) NodeCount() int

func (g *Graph[T]) RemoveChildren(id string) error

func (g *Graph[T]) RemoveEdge(from, to string) error

func (g *Graph[T]) RemoveNode(id string) error

func (g *Graph[T]) RemoveSubGraph(id string) error

func (g *Graph[T]) SetNode(id string, data T) error

func (g *Graph[T]) Sort() ([]T, error)

func (g *Graph[T]) SortNodeIDs() ([]string, error)

func (g *Graph[T]) String() string

func (g *Graph[T]) UpdateNode(id string, data T) error