- 1 for first call, 0 for subsequent calls.
</UL>
We have several algorithms to do this.  This implements algorithm A.
(For most practical work, the differences in performance are small.)
<A NAME="next_combo_b"></A><HR><PRE><B>int next_combo_b(int length, int basis[MAX_BASIS][MAX_COEF],
		 int num_basis, int constraints[MAX_COEF],
		 int combo[MAX_BASIS], int sum[MAX_COEF],
		 int start_flag);
</B></PRE>This routine gets the first or next appropriate subset of the
basis of solutions.  This implements algori