void lock_pairs(void)
bool is_path(int start, int end)
bool will_create_cycle(int winner, int loser) Cs50 Tideman Solution
After adding winner→loser, does loser have a path to winner in current locked graph? Yes → cycle. void lock_pairs(void) bool is_path(int start, int end) bool
Your job is to write the functions for steps 2, 3, 4, and 5. But step 4— lock_pairs —is where most people get stuck. void lock_pairs(void) bool is_path(int start