graph

Jul 5, 2023

Changes in this version

+ func AllPathsBetween(g Graph[K, T], start, end K) ([][]K, error)

May 24, 2023

Changes in this version

+ func StableTopologicalSort(g Graph[K, T], less func(K, K) bool) ([]K, error)

+ func VertexAttributes(attributes map[string]string) func(*VertexProperties)

May 18, 2023

Changes in this version

+ func BFSWithDepth(g Graph[K, T], start K, visit func(K, int) bool) error

May 1, 2023

Changes in this version

+ func EdgeAttributes(attributes map[string]string) func(*EdgeProperties)

type Graph

+ func NewLike(g Graph[K, T]) Graph[K, T]

+ AddEdgesFrom func(g Graph[K, T]) error

+ AddVerticesFrom func(g Graph[K, T]) error

+ Edges func() ([]Edge[K], error)

+ UpdateEdge func(source, target K, options ...func(properties *EdgeProperties)) error

type Store

+ UpdateEdge func(sourceHash, targetHash K, edge Edge[K]) error

Apr 23, 2023

Changes in this version

type Graph

+ func MaximumSpanningTree(g Graph[K, T]) (Graph[K, T], error)

+ func MinimumSpanningTree(g Graph[K, T]) (Graph[K, T], error)

Apr 15, 2023

Changes in this version

+ var ErrVertexHasEdges = errors.New("vertex has edges")

type Graph

+ func Union(g, h Graph[K, T]) (Graph[K, T], error)

+ RemoveVertex func(hash K) error

type Store

+ RemoveVertex func(hash K) error

Mar 1, 2023

Changes in this version

+ func EdgeData(data any) func(*EdgeProperties)

type EdgeProperties

+ Data any

type Graph

+ func NewWithStore(hash Hash[K, T], store Store[K, T], options ...func(*Traits)) Graph[K, T]

+ type Store interface

+ AddEdge func(sourceHash, targetHash K, edge Edge[K]) error

+ AddVertex func(hash K, value T, properties VertexProperties) error

+ Edge func(sourceHash, targetHash K) (Edge[K], error)

+ ListEdges func() ([]Edge[K], error)

+ ListVertices func() ([]K, error)

+ RemoveEdge func(sourceHash, targetHash K) error

+ Vertex func(hash K) (T, VertexProperties, error)

+ VertexCount func() (int, error)

Jan 18, 2023

Changes in this version

+ var ErrTargetNotReachable = errors.New("target vertex not reachable from source")

Nov 25, 2022

Changes in this version

+ var ErrEdgeAlreadyExists = errors.New("edge already exists")

+ var ErrEdgeCreatesCycle = errors.New("edge would create a cycle")

+ var ErrVertexAlreadyExists = errors.New("vertex already exists")

Nov 1, 2022

Changes in this version

+ var ErrVertexNotFound = errors.New("vertex not found")

Oct 14, 2022

Changes in this version

+ func PreventCycles() func(*Traits)

+ func VertexAttribute(key, value string) func(*VertexProperties)

+ func VertexWeight(weight int) func(*VertexProperties)

type Graph

+ VertexWithProperties func(hash K) (T, VertexProperties, error)

type Traits

+ PreventCycles bool

+ type VertexProperties struct

+ Attributes map[string]string

+ Weight int

Sep 19, 2022

Changes in this version

+ func PermitCycles() func(*Traits)

type Traits

+ PermitCycles bool

Sep 14, 2022

Changes in this version

type Graph

+ Order func() int

+ Size func() int

Sep 9, 2022

Changes in this version

+ func TopologicalSort(g Graph[K, T]) ([]K, error)

+ func TransitiveReduction(g Graph[K, T]) error

type Graph

+ Clone func() (Graph[K, T], error)

+ PredecessorMap func() (map[K]map[K]Edge[K], error)

+ RemoveEdge func(source, target K) error

Aug 17, 2022

Changes in this version

+ var ErrEdgeNotFound = errors.New("edge not found")

+ func BFS(g Graph[K, T], start K, visit func(T) bool) error

+ func CreatesCycle(g Graph[K, T], source, target K) (bool, error)

+ func DFS(g Graph[K, T], start K, visit func(T) bool) error

+ func ShortestPath(g Graph[K, T], source, target K) ([]K, error)

+ func StronglyConnectedComponents(g Graph[K, T]) ([][]K, error)

type Graph

+ AddEdge func(sourceHash, targetHash K, options ...func(*EdgeProperties)) error

+ AddVertex func(value T) error

+ Predecessors func(vertex K) (map[K]Edge[K], error)

Aug 1, 2022

Changes in this version

+ func EdgeAttribute(key, value string) func(*EdgeProperties)

+ func EdgeWeight(weight int) func(*EdgeProperties)

type Edge

+ Properties EdgeProperties

+ type EdgeProperties struct

+ Attributes map[string]string

+ Weight int

Jul 26, 2022

Changes in this version

type Edge

+ Attributes map[string]string

type Graph

+ Traits func() *Traits

+ type Traits struct

+ IsAcyclic bool

+ IsDirected bool

+ IsRooted bool

+ IsWeighted bool

Jul 22, 2022

Changes in this version

type Graph

+ AdjacencyMap func() map[K]map[K]Edge[K]

Jul 21, 2022

Changes in this version

type Graph

+ AdjacencyList func() map[K][]K

Jul 1, 2022

Changes in this version

type Graph

+ ShortestPath func(source, target T) ([]K, error)

+ ShortestPathByHashes func(sourceHash, targetHash K) ([]K, error)

Jun 27, 2022

Changes in this version

type Graph

+ StronglyConnectedComponents func() ([][]K, error)

Jun 20, 2022

Changes in this version

type Graph

+ Degree func(vertex T) (int, error)

+ DegreeByHash func(vertexHash K) (int, error)

Jun 19, 2022

Changes in this version

+ func Acyclic() func(*properties)

+ func Directed() func(*properties)

+ func Int32Hash(v int32) int32

+ func Int64Hash(v int64) int64

+ func IntHash(v int) int

+ func Rooted() func(*properties)

+ func StringHash(v string) string

+ func Tree() func(*properties)

+ func Uint32Hash(v uint32) uint32

+ func Uint64Hash(v uint64) uint64

+ func Weighted() func(*properties)

+ type Edge struct

+ Source T

+ Target T

+ Weight int

+ type Graph interface

+ BFS func(start T, visit func(value T) bool) error

+ BFSByHash func(startHash K, visit func(value T) bool) error

+ CreatesCycle func(source, target T) (bool, error)

+ CreatesCycleByHashes func(sourceHash, targetHash K) (bool, error)

+ DFS func(start T, visit func(value T) bool) error

+ DFSByHash func(startHash K, visit func(value T) bool) error

+ Edge func(source, target T) error

+ EdgeByHashes func(sourceHash, targetHash K) error

+ GetEdge func(source, target T) (Edge[T], bool)

+ GetEdgeByHashes func(sourceHash, targetHash K) (Edge[T], bool)

+ Vertex func(value T)

+ WeightedEdge func(source, target T, weight int) error

+ WeightedEdgeByHashes func(sourceHash, targetHash K, weight int) error

+ func New(hash Hash[K, T], options ...func(*properties)) Graph[K, T]

+ type Hash func(T) K