message: Gecko: removed the nonrecursive option since it doesn't compile and disturbs Doxygen as a result.
diff: #define GECKO_WITH_ADJLIST 0
  #endif
  -// use nonrecursive permutation algorithm
  -#ifndef GECKO_WITH_NONRECURSIVE
  -#define GECKO_WITH_NONRECURSIVE 0
  -#endif
  -
  // use double-precision computations
  #ifndef GECKO_WITH_DOUBLE_PRECISION
  #define GECKO_WITH_DOUBLE_PRECISION 0
  @@ -460,45 +455,6 @@ Subgraph::swap(uint k, uint l)
  node[j] += (1u << i) + m;
  }
  -#if GECKO_WITH_NONRECURSIVE
  -// Evaluate all permutations generated by Heap's nonrecursive algorithm.
  -void
  -Subgraph::optimize()
  -{
  - WeightedSum c[GECKO_WINDOW_MAX + 1];
  - uint j[GECKO_WINDOW_MAX + 1];
  - Float min = GECKO_FLOAT_MAX;
  - j[n] = 1;
  - c[n] = 0;
  - uint i = n;
  - do
  - {
  - i--;
  - j[i] = i;
  - loop:
  - c[i] = f->sum(c[i + 1], cost(i));
  - }
  - while (i);
  - if (f->less(*c, min))
  - {
  - min = *c;
  - for (uint k = 0; k < n; k++)
  - {
  - best[k] = perm[k];
  - }
  - }
  - do
  - {
  - if (++i == n)
  - {
  - return;
  - }
  - swap(i & 1 ? i - j[i] : 0, i);
  - }
  - while (!j[i]--);
  - goto loop;
  -}
  -#else
  // Apply branch-and-bound to permutations generated by Heap's algorithm.
  void
  Subgraph::optimize(WeightedSum c, uint i)
  @@ -533,7 +489,6 @@ Subgraph::optimize(WeightedSum c, uint i)
  do { swap(--i); }
  while (i);
  }
  -#endif
  // Optimize layout of nodes {p, ..., p + n - 1}.
  void
  