public class DeBruijn extends ExampleFD
It finds both "normal" and "arbitrary" de Bruijn sequences.
This is a port from my MiniZinc model http://www.hakank.org/minizinc/debruijn_binary.mzn
and is explained somewhat in the swedish blog post "Constraint Programming: Minizinc, Gecode/flatzinc och ECLiPSe/minizinc" http://www.hakank.org/webblogg/archives/001209.html
Related programs: - "Normal" de Bruijn sequences CGI program for calculating the sequences http://www.hakank.org/comb/debruijn.cgi http://www.hakank.org/comb/deBruijnApplet.html (as Java applet)
- "Arbitrary" de Bruijn sequences Program "de Bruijn arbitrary sequences" http://www.hakank.org/comb/debruijn_arb.cgi
This (swedish) blog post explains the program: "de Bruijn-sekvenser av godtycklig längd" http://www.hakank.org/webblogg/archives/001114.html
Modifier and Type | Field and Description |
---|---|
int |
base |
IntVar[][] |
binary |
int |
m |
int |
n |
IntVar[] |
x |
Constructor and Description |
---|
DeBruijn() |
Modifier and Type | Method and Description |
---|---|
static void |
main(String[] args)
Running the program
java DeBruijn base n
java DeBruijn base n m
|
void |
model()
It specifies a standard way of modeling the problem.
|
creditSearch, getSearch, getSearchVariables, getStore, printMatrix, search, searchAllAtOnce, searchAllOptimal, searchLDS, searchMasterSlave, searchMaxRegretOptimal, searchMiddle, searchMostConstrainedStatic, searchOptimal, searchSmallestDomain, searchSmallestMedian, searchSmallestMiddle, searchSmallestMin, searchWeightedDegree, searchWithMaxRegret, searchWithRestarts, shavingSearch
public int base
public int n
public int m
public IntVar[] x
public IntVar[][] binary
Copyright © 2022. All rights reserved.