// output of ./demo/graph/graph-debruijn-m-demo.cc: // Description: //% Find all paths through the m-ary De Bruijn graph. arg 1: 3 == m [m-ary De Bruijn graph] default=3 arg 2: 3 == n [size of graph == m*n] default=3 arg 3: 5 == pq [what to print with each path: 0==> nothing (just count) 1==> lowest bits (De Bruijn sequence) 2==> path 3==> De Bruijn sequence and path ] default=5 arg 4: 0 == maxnp [stop after maxnp paths (0: never stop)] default=0 arg 5: 0 == p0 [start position