--- AFTER SORTING (by victory strength) --- Rank 1: STRONGEST - Pair 1: Alice vs Bob Margin: Alice wins by 2 votes
// Modified lock_pairs function with verbose output bool lock_pairs_verbose(void) { printf("\n=== LOCKING PAIRS (with cycle detection) ===\n"); cs50 tideman
// Helper function to check if adding edge creates cycle (same as original but made callable) bool creates_cycle_helper(int start, int end) { if (start == end) return true; --- AFTER SORTING (by victory strength) --- Rank
sort_pairs(); lock_pairs_verbose(); // MODIFIED VERSION with visualization for (int i = 0
// Display after sorting with tie information printf("\n--- AFTER SORTING (by victory strength) ---\n"); for (int i = 0; i < pair_count; i++) { int margin = preferences[pairs[i].winner][pairs[i].loser] - preferences[pairs[i].loser][pairs[i].winner]; printf("\nRank %i: ", i + 1); if (margin > 0) printf("STRONGEST - "); else if (margin == 0) printf("TIE - "); display_pair_votes(i); }
return true; }