|
|
back to boardjust dfs giving TLE in test case 21 my program just does dfs three times on the graph.... and so has order O(|n| + |e|) where n is number of nodes and e is edges till gives TLE in case 21... :( do we need a better algorithm than this as well...? |
|
|