Previous: Periodic boundary conditions Up: Details of the simulation program Next: The numerical step

The pairing step

The pairing function proved to be the most difficult part of the whole simulation. A satisfactory pairing function has yet to be properly written, although several attempts were made. It is possible to do the pairing in time, however this algorithm has presented certain implementation problems. The best explanation is probably a chronological one.

• greedy algorithm
• stable marriage algorithm
• brute force algorithm
• hungarian algorithm

-----------------------------------------------

• Greedy algorithm
• Stable Marriage algorithm
• Brute force
• Hungarian algorithm