Cs50 Tideman Solution Link

return;

// ties are ignored

// locked[i][j] means i is locked over j bool locked[MAX][MAX]; Cs50 Tideman Solution

function must correctly sort pairs in decreasing order of "strength of victory" (the number of voters who preferred the winner over the loser) before lock_pairs is called. : The simplest base case for the recursion is when the node of the current edge is the same as the node of the initial edge you are trying to lock. Graph Representation locked[i][j] 2D boolean array represents a directed edge from candidate to candidate return; // ties are ignored // locked[i][j] means