graph

package

Go to main page

Versions in this module

v2

v2.16.0

Jul 24, 2024

Changes in this version

type AdjacencyMatrix

+ func NewMultiAdjacencyMatrix() AdjacencyMatrix

+ func (m AdjacencyMatrix) Weight(source, target VertexIndex) Weight

+ type Decremental interface

+ IncreaseWeight func(source VertexIndex, weight Weight)

+ RemoveEdge func(source VertexIndex, target VertexIndex)

+ RemoveVertex func(VertexIndex)

+ func TeeDecremental(a, b Decremental) Decremental

+ type Dynamic interface

+ func TeeDynamic[W Weight](a, b Dynamic) Dynamic

+ type Incremental interface

+ AddEdge func(source VertexIndex, target VertexIndex)

+ AddVertex func(VertexIndex)

+ DecreaseWeight func(source VertexIndex, weight Weight)

+ func TeeIncremental(a, b Incremental) Incremental

type Iterator

+ Weight func(source, target VertexIndex) Weight

v2.15.0

Jun 3, 2024

Changes in this version

+ func UnitWeightFunc(_, _ VertexIndex) int

type BfsTree

+ func NewWeightedBfsTree[W Weight]() *BfsTree[W]

+ func (t *BfsTree[W]) CalculateUnweighted(graph Iterator, start VertexIndex)

+ func (t *BfsTree[W]) CalculateWeightedGeneral(graph Iterator, start VertexIndex, weight WeightFunc[W])

+ func (t BfsTree[W]) Edges(source VertexIndex) EdgeIterator

+ type Weight interface

+ type WeightFunc func(source, target VertexIndex) W

v2.14.0

Jun 3, 2024

Changes in this version

type AdjacencyMatrix

+ func (m AdjacencyMatrix) UnitWeightFunc(source, target VertexIndex) (weight int, ok bool)

+ func (m AdjacencyMatrix) UnitWeightedIterator(it Iterator) WeightedIterator[int]

+ type BfsTree struct

+ func NewBfsTree() *BfsTree

+ func (t *BfsTree) Calculate(graph Iterator, start VertexIndex)

+ func (t *BfsTree) Clear()

+ func (t *BfsTree) Resize(n int)

+ func (t BfsTree) Distance(vertex VertexIndex) (int, bool)

+ func (t BfsTree) Predecessor(vertex VertexIndex) (VertexIndex, bool)

+ func (t BfsTree) Reachable(vertex VertexIndex) bool

+ func (t BfsTree) Vertexes() VertexIterator

+ type WeightedEdges struct

+ Parent Iterator

+ WeightFunc func(source, target VertexIndex) (weight Weight, ok bool)

+ func (v WeightedEdges[W]) Edges(source VertexIndex) EdgeIterator

+ func (v WeightedEdges[W]) Vertexes() VertexIterator

+ func (v WeightedEdges[W]) Weight(source, target VertexIndex) (weight W, ok bool)

+ type WeightedIterator interface

+ Weight func(source, target VertexIndex) (weight Weight, ok bool)

v2.13.0

May 28, 2024

Changes in this version

+ type AdjacencyMatrix struct

+ func NewAdjacencyMatrix(m matrix.Constructor[int]) AdjacencyMatrix

+ func (m AdjacencyMatrix) Calculate(g Iterator)

+ func (m AdjacencyMatrix) Clear()

+ func (m AdjacencyMatrix) CountEdges() int

+ func (m AdjacencyMatrix) Degree(source VertexIndex) int

+ func (m AdjacencyMatrix) Edges(source VertexIndex) func() (VertexIndex, int, bool)

+ func (m AdjacencyMatrix) Get(source, target VertexIndex) int

+ func (m AdjacencyMatrix) Indegree(target VertexIndex) int

+ func (m AdjacencyMatrix) Matrix() matrix.Interface[int]

+ func (m AdjacencyMatrix) Outdegree(source VertexIndex) int

+ func (m AdjacencyMatrix) Resize(width int)

+ func (m AdjacencyMatrix) Set(source, target VertexIndex, count int)

+ func (m AdjacencyMatrix) Vertexes() func() (VertexIndex, bool)

+ func (m AdjacencyMatrix) Width() int

+ type DegreeMatrix struct

+ func NewDegreeMatrix() DegreeMatrix

+ func (m DegreeMatrix) Calculate(g func() VertexIterator, degree func(index VertexIndex) int)

+ func (m DegreeMatrix) Clear()

+ func (m DegreeMatrix) CountEdges() int

+ func (m DegreeMatrix) Get(source VertexIndex) int

+ func (m DegreeMatrix) Matrix() matrix.Interface[int]

+ func (m DegreeMatrix) Resize(width int)

+ func (m DegreeMatrix) Set(source VertexIndex, count int)

+ func (m DegreeMatrix) Width() int

+ type EdgeIndex int

+ type EdgeIterator = func() (target VertexIndex, count int, ok bool)

+ type FilterEdges struct

+ Filter func(source VertexIndex, target VertexIndex) bool

+ Parent Iterator

+ func (f FilterEdges) Edges(source VertexIndex) func() (VertexIndex, int, bool)

+ func (f FilterEdges) Vertexes() func() (VertexIndex, bool)

+ type FilterVertexes struct

+ Filter func(vertex VertexIndex) bool

+ Parent Iterator

+ func (f FilterVertexes) Edges(source VertexIndex) func() (VertexIndex, int, bool)

+ func (f FilterVertexes) Vertexes() func() (VertexIndex, bool)

+ type Iterator interface

+ Edges func(source VertexIndex) EdgeIterator

+ Vertexes func() VertexIterator

+ type Number interface

+ type VertexIndex int

+ type VertexIterator = func() (vertex VertexIndex, ok bool)

+ func Leaves(vertexes func() VertexIterator, indegree func(VertexIndex) int, ...) VertexIterator

+ func Roots(vertexes func() VertexIterator, indegree func(VertexIndex) int) VertexIterator

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL