Versions in this module Expand all Collapse all v1 v1.4.4 Nov 14, 2019 Changes in this version + func CombinationsExceed(n, k, threshold int) bool + type Iterator interface + Next func() *TreeVertex + type Tree struct + Root *TreeVertex + func (t *Tree) BFS() Iterator + func (t *Tree) Permute(combinationUpperBound int) []*Tree + type TreeVertex struct + Data interface{} + Descendants []*TreeVertex + Id string + Threshold int + func NewTreeVertex(id string, data interface{}, descendants ...*TreeVertex) *TreeVertex + func (v *TreeVertex) AddDescendant(u *TreeVertex) *TreeVertex + func (v *TreeVertex) Clone() *TreeVertex + func (v *TreeVertex) Exists(id string) bool + func (v *TreeVertex) Find(id string) *TreeVertex + func (v *TreeVertex) IsLeaf() bool + func (v *TreeVertex) ToTree() *Tree + type Vertex struct + Data interface{} + Id string + func NewVertex(id string, data interface{}) *Vertex + func (v *Vertex) AddNeighbor(u *Vertex) + func (v *Vertex) NeighborById(id string) *Vertex + func (v *Vertex) Neighbors() []*Vertex
Go to main page