Your algorithm is extremely fast.
Do you have an example to better explain the algorithm?
maybe read this:
http://lalescu.ro/liviu/fet/doc/en/generation-algorithm-description.html
and
http://lalescu.ro/liviu/fet/doc/en/generation-algorithm-details.html
and
http://lalescu.ro/liviu/fet/doc/en/generation-algorithm-references.html
Quote from: aspx on March 01, 2013, 12:58:35 PM
Your algorithm is extremely fast.
Do you have an example to better explain the algorithm?
Unfortunately, not. But this can be created. And adding in the code comments to help you understand what's going on. Maybe the best is to start with a file containing only basic constraints, like the German subact_constr with all other constraints removed.
Thank you
But can you explain to me about this part:
2 d) Recursively try to place A_p, A_q, A_r ....
Quote from: aspx on March 01, 2013, 04:47:06 PM
But can you explain to me about this part:
2 d) Recursively try to place A_p, A_q, A_r ....
Call subroutine starting at step 2) three times, one at a time for A_p, A_q, and A_r, respectively.