lib

Aug 7, 2022

Changes in this version

+ func TransparentEncoding()

Aug 6, 2022

Changes in this version

+ func WriteDecomp(input Decomp) []byte

type Decomp

+ func GetDecomp(input []byte, graph Graph, encoding map[string]int) Decomp

+ func (d Decomp) IntoJson() DecompJson

+ type DecompJson struct

+ Root NodeJson

+ func (d DecompJson) IntoDecomp(graph Graph, encoding map[string]int) Decomp

type Node

+ func (n Node) IntoJson() NodeJson

+ type NodeJson struct

+ Bag []string

+ Children []NodeJson

+ Cover []string

+ func (n NodeJson) IntoNode(graph Graph, encoding map[string]int) Node

Nov 27, 2021

Changes in this version

type BalancedCheck

+ func (b BalancedCheck) CheckOut(H *Graph, sep *Edges, balFactor int) (bool, []Graph)

+ type EdgesCostMap struct

+ func (m *EdgesCostMap) Cost(edgeComb []int) float64

+ func (m *EdgesCostMap) Init()

+ func (m *EdgesCostMap) Put(edgeComb []int, c float64)

+ func (m EdgesCostMap) Records() ([]uint64, []float64)

+ type JoinHeap []*Separator

+ func (jh *JoinHeap) Pop() interface{}

+ func (jh *JoinHeap) Push(x interface{})

+ func (jh JoinHeap) Len() int

+ func (jh JoinHeap) Less(i, j int) bool

+ func (jh JoinHeap) Swap(i, j int)

type Node

+ Cost float64

+ type Separator struct

+ Cost float64

+ EdgeComb []int

+ Found []int

Aug 26, 2021

Changes in this version

type DSD

+ func (d *DSD) AddSepVertices(e Edge)

type Graph

+ func (g *Graph) MakeEdgesDistinct() []int

type Node

+ func (n *Node) RemoveVertices(vertices []int)

Aug 23, 2021

Changes in this version

+ type DSD struct

+ Comps map[*disjoint.Element][]Edge

+ CompsSp map[*disjoint.Element][]Edges

+ Graph *Graph

+ SepVertices map[int]bool

+ Vertices map[int]*disjoint.Element

+ func (d *DSD) Update(e Edge)

Jul 1, 2021

Changes in this version

type CombinationIterator

+ BalSep bool

+ Combination []int

+ Confirmed bool

+ Empty bool

+ Extended bool

+ K int

+ N int

+ OldK int

+ StepSize int

Jun 30, 2021

Changes in this version

type Edges

+ func (e *Edges) GobDecode(b []byte) error

+ func (e *Edges) GobEncode() ([]byte, error)

Jun 17, 2021

Changes in this version

type CombinationIterator

+ func (c *CombinationIterator) CheckFound() bool

+ func (c *CombinationIterator) Confirm()

+ func (c *CombinationIterator) Found()

+ func (c *CombinationIterator) GetNext() []int

+ func (c *CombinationIterator) HasNext() bool

+ type Generator interface

+ CheckFound func() bool

+ Confirm func()

+ Found func()

+ GetNext func() []int

+ HasNext func() bool

+ type ParallelSearch struct

+ BalFactor int

+ Edges *Edges

+ ExhaustedSearch bool

+ Generators []Generator

+ H *Graph

+ Result []int

+ func (s *ParallelSearch) FindNext(pred Predicate)

+ func (s *ParallelSearch) GetResult() []int

+ func (s *ParallelSearch) SearchEnded() bool

+ type ParallelSearchGen struct

+ func (p ParallelSearchGen) GetSearch(H *Graph, Edges *Edges, BalFactor int, Gens []Generator) Search

type Search

+ GetResult func() []int

+ SearchEnded func() bool

+ type SearchGenerator interface

+ GetSearch func(H *Graph, Edges *Edges, BalFactor int, Generators []Generator) Search

Mar 21, 2021

Changes in this version

type CombinationIterator

+ func (c CombinationIterator) GetPercentageFull() (int, int)

Mar 17, 2021

Changes in this version

+ func GetPercentagesSlice(cs []*CombinationIterator) float32

Feb 19, 2021

Changes in this version

type Cache

+ func (c *Cache) Reset()

type Edge

+ func (e Edge) FullStringInt() string

type Graph

+ func (g Graph) ToHyberBenchFormat() string

Feb 11, 2021

Changes in this version

+ var Empty struct

+ func Diff(a, b []int) []int

+ func GetGraph(s string) (Graph, ParseGraph)

+ func IntHash(vertices []int) uint32

+ func Inter(as, bs []int) []int

+ func PrintVertices(vertices []int) string

+ func RemoveDuplicates(elements []int) []int

+ func Subset(as []int, bs []int) bool

+ type AlgorithmH interface

+ FindDecomp func() Decomp

+ FindDecompGraph func(G Graph) Decomp

+ Name func() string

+ SetWidth func(K int)

+ type BalancedCheck struct

+ func (b BalancedCheck) Check(H *Graph, sep *Edges, balFactor int) bool

+ type Cache struct

+ func (c *Cache) AddNegative(sep Edges, comp Graph)

+ func (c *Cache) AddPositive(sep Edges, comp Graph)

+ func (c *Cache) CheckNegative(sep Edges, comps []Graph) bool

+ func (c *Cache) CheckPositive(sep Edges, comps []Graph) bool

+ func (c *Cache) CopyRef(other *Cache)

+ func (c *Cache) Init()

+ func (c *Cache) Len() int

+ type CombinationIterator struct

+ func SplitCombin(n int, k int, split int, unextended bool) []*CombinationIterator

+ func (c CombinationIterator) GetPercentage() float32

+ type Cover struct

+ HasNext bool

+ InComp []bool

+ Subset []int

+ func NewCover(K int, vertices []int, bound Edges, compVertices []int) Cover

+ func (c *Cover) NextSubset() int

+ type Decomp struct

+ Graph Graph

+ Root Node

+ SkipRerooting bool

+ UpConnecting bool

+ func GetDecompGML(input string, graph Graph, encoding map[string]int) Decomp

+ func (d *Decomp) RestoreSubedges()

+ func (d Decomp) CheckWidth() int

+ func (d Decomp) Correct(g Graph) bool

+ func (d Decomp) String() string

+ func (d Decomp) ToGML() string

+ type Edge struct

+ Name int

+ Vertices []int

+ func (e Edge) FullString() string

+ func (e Edge) Hash() uint64

+ func (e Edge) String() string

+ type Edges struct

+ func CutEdges(edges Edges, vertices []int) Edges

+ func FilterVertices(edges Edges, vertices []int) Edges

+ func FilterVerticesStrict(edges Edges, vertices []int) Edges

+ func GetDegreeOrder(edges Edges) Edges

+ func GetEdgeDegreeOrder(edges Edges) Edges

+ func GetMSCOrder(edges Edges) Edges

+ func GetMaxSepOrder(edges Edges) Edges

+ func GetSubset(edges Edges, s []int) Edges

+ func NewEdges(slice []Edge) Edges

+ func (e *Edges) Diff(other Edges) Edges

+ func (e *Edges) Hash() uint64

+ func (e *Edges) RemoveDuplicates()

+ func (e *Edges) Vertices() []int

+ func (e Edges) FullString() string

+ func (e Edges) Len() int

+ func (e Edges) Less(i, j int) bool

+ func (e Edges) Slice() []Edge

+ func (e Edges) String() string

+ func (e Edges) Swap(i, j int)

+ type GYÖReduct interface

+ type Graph struct

+ Edges Edges

+ Special []Edges

+ func GetGraphPACE(s string) Graph

+ func (g *Graph) Hash() uint64

+ func (g *Graph) Vertices() []int

+ func (g Graph) ComputeSubEdges(K int) Graph

+ func (g Graph) GYÖReduct() (Graph, []GYÖReduct)

+ func (g Graph) GetBIP() int

+ func (g Graph) GetComponents(sep Edges) ([]Graph, map[int]int, []Edge)

+ func (g Graph) GetSubset(s []int) Edges

+ func (g Graph) Len() int

+ func (g Graph) String() string

+ func (g Graph) ToPACE() string

+ func (g Graph) TypeCollapse() (Graph, map[int][]int, int)

+ type Hingetree struct

+ func GetHingeTree(g Graph) Hingetree

+ func (h Hingetree) DecompHinge(alg AlgorithmH, g Graph) Decomp

+ func (h Hingetree) GetLargestGraph() Graph

+ func (h Hingetree) String() string

+ type Node struct

+ Bag []int

+ Children []Node

+ Cover Edges

+ func (n *Node) CombineNodes(subtree Node, connecting Edges) *Node

+ func (n *Node) Vertices() []int

+ func (n Node) Reroot(child Node) Node

+ func (n Node) RerootEdge(edge []int) Node

+ func (n Node) RestoreGYÖ(reducts []GYÖReduct) (Node, bool)

+ func (n Node) RestoreTypes(restoreMap map[int][]int) (Node, bool)

+ func (n Node) String() string

+ type ParentCheck struct

+ Child []int

+ Conn []int

+ func (p ParentCheck) Check(H *Graph, sep *Edges, balFactor int) bool

+ type ParseGraph struct

+ Edges []parseEdge

+ Encoding map[string]int

+ func (p *ParseGraph) GetEdge(input string) Edge

+ type Predicate interface

+ Check func(H *Graph, sep *Edges, balancedFactor int) bool

+ type Search struct

+ BalFactor int

+ Edges *Edges

+ ExhaustedSearch bool

+ Generators []*CombinationIterator

+ H *Graph

+ Result []int

+ func (s *Search) FindNext(pred Predicate)

+ type SepSub struct

+ func GetSepSub(edges Edges, sep Edges, k int) *SepSub

+ func (sep *SepSub) HasNext() bool

+ func (sep SepSub) GetCurrent() Edges