Versions in this module Expand all Collapse all v0 v0.2.5 Sep 28, 2023 v0.2.4 Aug 30, 2023 Changes in this version + func GetD2S(t Tree[T], src, dst T) []T + func GetFitD2S(t Tree[T], src, dst T) []T + func GetFitS2D(t Tree[T], src, dst T) []T + func GetS2D(t Tree[T], src, dst T) []T + type DegreeFunc func(u, v T) int + type GraphMap map[T][]T + func (x GraphMap[T]) Adjacency(prev T) []T + func (x GraphMap[T]) BFS(s T) GraphMapTree[T] + func (x GraphMap[T]) BreadthFirstSearch(s T, max_degree int, degree DegreeFunc[T]) GraphMapTree[T] + func (x GraphMap[T]) DFS(s T) GraphMapTree[T] + func (x GraphMap[T]) DepthFirstSearch(s T, max_degree int, degree DegreeFunc[T]) GraphMapTree[T] + func (x GraphMap[T]) NewTree() Tree[T] + type GraphMapTree map[T]T + func (x GraphMapTree[T]) Get(next T) (T, bool) + func (x GraphMapTree[T]) Set(next, prev T) + type Grapher interface + Adjacency func(prev T) []T + NewTree func() Tree[T] + Weight func(prev T, next T) int + type Searcher interface + Adjacency func(prev T) []T + NewTree func() Tree[T] + type Tree interface + Get func(next T) (T, bool) + Set func(next, prev T) + func BFS(x Searcher[T], s T) Tree[T] + func BreadthFirstSearch(x Searcher[T], s T, max_degree int, degree DegreeFunc[T]) Tree[T] + func DFS(x Searcher[T], s T) Tree[T] + func DepthFirstSearch(x Searcher[T], s T, max_degree int, degree DegreeFunc[T]) Tree[T] + func Dijkstra(g Grapher[T], s T) Tree[T] + type Weight interface + Add func(Weight) Weight + Less func(Weight) bool