union_find

type UF ¶

type UF struct {
	// contains filtered or unexported fields
}

UF data type models connectivity among a set of n sites. This implementation uses weighted quick union by rank with path compression by halving during find operation.

func NewUnionFind(n int) *UF

func (uf *UF) Connected(p, q int) bool

func (uf *UF) Count() int

func (uf *UF) Find(p int) int

func (uf *UF) Union(p, q int)