algorithms

package

Go to main page

Versions in this module

v1

v1.7.2

Aug 7, 2022

v1.7.0

Aug 6, 2022

v1.6.15

Nov 27, 2021

Changes in this version

+ type JCostBalSepLocal struct

+ BalFactor int

+ Generator lib.SearchGenerator

+ Graph lib.Graph

+ JCosts lib.EdgesCostMap

+ K int

+ func (b *JCostBalSepLocal) SetGenerator(Gen lib.SearchGenerator)

+ func (b *JCostBalSepLocal) SetWidth(K int)

+ func (b JCostBalSepLocal) FindDecomp() lib.Decomp

+ func (b JCostBalSepLocal) FindDecompGraph(G lib.Graph) lib.Decomp

+ func (b JCostBalSepLocal) Name() string

v1.6.14

Aug 27, 2021

v1.6.13

Aug 27, 2021

v1.6.12

Aug 26, 2021

v1.6.11

Aug 23, 2021

v1.6.10

Jul 11, 2021

v1.6.9

Jul 1, 2021

v1.6.8

Jul 1, 2021

v1.6.7

Jun 30, 2021

v1.6.6

Jun 17, 2021

Changes in this version

type Algorithm

+ SetGenerator func(S lib.SearchGenerator)

type BalSepGlobal

+ Generator lib.SearchGenerator

+ func (b *BalSepGlobal) SetGenerator(Gen lib.SearchGenerator)

type BalSepHybrid

+ Generator lib.SearchGenerator

+ func (b *BalSepHybrid) SetGenerator(Gen lib.SearchGenerator)

type BalSepHybridSeq

+ Generator lib.SearchGenerator

+ func (b *BalSepHybridSeq) SetGenerator(Gen lib.SearchGenerator)

type BalSepLocal

+ Generator lib.SearchGenerator

+ func (b *BalSepLocal) SetGenerator(Gen lib.SearchGenerator)

type DetKDecomp

+ func (d *DetKDecomp) SetGenerator(Gen lib.SearchGenerator)

type LogKDecomp

+ Generator lib.SearchGenerator

+ func (l *LogKDecomp) SetGenerator(Gen lib.SearchGenerator)

type LogKHybrid

+ Generator lib.SearchGenerator

+ func (l *LogKHybrid) SetGenerator(Gen lib.SearchGenerator)

v1.6.5

May 20, 2021

v1.6.4

Apr 10, 2021

Changes in this version

+ type SplitDecomp struct

+ Graph lib.Graph

+ K int

+ func (d *SplitDecomp) FindDecomp() lib.Decomp

+ func (d *SplitDecomp) FindDecompGraph(G lib.Graph) lib.Decomp

+ func (d *SplitDecomp) Name() string

+ func (d *SplitDecomp) SetWidth(K int)

v1.6.3

Apr 8, 2021

v1.6.2

Mar 21, 2021

v1.6.1

Mar 17, 2021

Changes in this version

+ type AlgorithmDebug interface

+ GetCounters func() Counters

+ type Counters struct

+ func (c *Counters) AddBacktrack(level int)

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

+ func (c *Counters) Init()

+ func (c *Counters) String() string

type LogKHybrid

+ func (l *LogKHybrid) GetCounters() Counters

v1.6.0

Feb 21, 2021

v1.5.7

Feb 19, 2021

v1.5.6

Feb 13, 2021

v1.5.5

Feb 12, 2021

v1.5.4

Feb 11, 2021

v1.5.3

Feb 11, 2021

v1.5.2

Feb 11, 2021

v1.5.1

Feb 11, 2021

Changes in this version

+ type Algorithm interface

+ FindDecomp func() lib.Decomp

+ FindDecompGraph func(G lib.Graph) lib.Decomp

+ Name func() string

+ SetWidth func(K int)

+ type BalSepGlobal struct

+ BalFactor int

+ Graph lib.Graph

+ K int

+ func (b *BalSepGlobal) SetWidth(K int)

+ func (b BalSepGlobal) FindDecomp() lib.Decomp

+ func (b BalSepGlobal) FindDecompGraph(G lib.Graph) lib.Decomp

+ func (b BalSepGlobal) Name() string

+ type BalSepHybrid struct

+ BalFactor int

+ Depth int

+ Graph lib.Graph

+ K int

+ func (b *BalSepHybrid) SetWidth(K int)

+ func (b BalSepHybrid) FindDecomp() lib.Decomp

+ func (b BalSepHybrid) FindDecompGraph(G lib.Graph) lib.Decomp

+ func (b BalSepHybrid) Name() string

+ type BalSepHybridSeq struct

+ BalFactor int

+ Depth int

+ Graph lib.Graph

+ K int

+ func (s *BalSepHybridSeq) SetWidth(K int)

+ func (s BalSepHybridSeq) FindDecomp() lib.Decomp

+ func (s BalSepHybridSeq) FindDecompGraph(G lib.Graph) lib.Decomp

+ func (s BalSepHybridSeq) Name() string

+ type BalSepLocal struct

+ BalFactor int

+ Graph lib.Graph

+ K int

+ func (b *BalSepLocal) SetWidth(K int)

+ func (b BalSepLocal) FindDecomp() lib.Decomp

+ func (b BalSepLocal) FindDecompGraph(G lib.Graph) lib.Decomp

+ func (b BalSepLocal) Name() string

+ type DetKDecomp struct

+ BalFactor int

+ Graph lib.Graph

+ K int

+ SubEdge bool

+ func (d *DetKDecomp) FindDecomp() lib.Decomp

+ func (d *DetKDecomp) FindDecompGraph(G lib.Graph) lib.Decomp

+ func (d *DetKDecomp) Name() string

+ func (d *DetKDecomp) SetWidth(K int)

+ type HybridPredicate = func(H lib.Graph, K int) bool

+ type LogKDecomp struct

+ BalFactor int

+ Graph lib.Graph

+ K int

+ func (l *LogKDecomp) FindDecomp() lib.Decomp

+ func (l *LogKDecomp) FindDecompGraph(Graph lib.Graph) lib.Decomp

+ func (l *LogKDecomp) Name() string

+ func (l *LogKDecomp) SetWidth(K int)

+ type LogKHybrid struct

+ BalFactor int

+ Graph lib.Graph

+ K int

+ Predicate HybridPredicate

+ Size int

+ func (l *LogKHybrid) ETimesKDivAvgEdgePred(H lib.Graph, K int) bool

+ func (l *LogKHybrid) FindDecomp() lib.Decomp

+ func (l *LogKHybrid) FindDecompGraph(Graph lib.Graph) lib.Decomp

+ func (l *LogKHybrid) Name() string

+ func (l *LogKHybrid) NumberEdgesPred(H lib.Graph, K int) bool

+ func (l *LogKHybrid) OneRoundPred(H lib.Graph, K int) bool

+ func (l *LogKHybrid) SetWidth(K int)

+ func (l *LogKHybrid) SumEdgesPred(H lib.Graph, K int) bool

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL