The most complex part of the solution is lock_pairs . The goal is to create a directed graph (the locked adjacency matrix) without creating a "cycle" (a loop where
, add that pair to the pairs array and increment pair_count . Cs50 Tideman Solution
: This usually requires a recursive helper function (often called has_cycle or is_cyclic ). If you are trying to lock a pair where , you must check if is already connected to The most complex part of the solution is lock_pairs