Optimal_Sorting_Networks

• Model based on Optimal Sorting Networks (Daniel Bundala and Jakub Zavodny)
• Requires OR-Tools and C++20 (because of std::format)
• This generates all $2^{n}$ binary sequences and then constructs a model based on that. Requires Channel_Size and Original_Depth as input.
• Two objectives available: MINIMIZE_DEPTH or MINIMIZE_TOTAL_COMPARATORS.

Example Output

Status = Optimal
Channel Size = 4
Original Depth = 4
Obj_Type = MINIMIZE_DEPTH, Obj_Val = 3
Depth: 1, Index: [(0, 3), (1, 2)]
Depth: 2, Index: [(0, 1), (2, 3)]
Depth: 3, Index: [(1, 2)]
Validation Started
Validation Finished