Versions in this module Expand all Collapse all v1 v1.0.3 Jul 20, 2015 Changes in this version + func Equal(s1, s2 Set) bool + func Same(s1, s2 Set) bool + type BySliceValues [][]int + func (c BySliceValues) Len() int + func (c BySliceValues) Less(i, j int) bool + func (c BySliceValues) Swap(i, j int) + type IntSet map[int]struct + func (s IntSet) Add(e int) + func (s IntSet) Count() int + func (s IntSet) Has(e int) bool + func (s IntSet) Remove(e int) + type NodeQueue struct + func (q *NodeQueue) Dequeue() graph.Node + func (q *NodeQueue) Enqueue(n graph.Node) + func (q *NodeQueue) Len() int + func (q *NodeQueue) Reset() + type NodeStack []graph.Node + func (s *NodeStack) Len() int + func (s *NodeStack) Pop() graph.Node + func (s *NodeStack) Push(n graph.Node) + type Set map[int]graph.Node + func Clear(s Set) Set + func (dst Set) Copy(src Set) Set + func (dst Set) Intersect(s1, s2 Set) Set + func (dst Set) Union(s1, s2 Set) Set + func (s Set) Add(n graph.Node) + func (s Set) Has(n graph.Node) bool + func (s Set) Remove(e graph.Node)