So I\'ve been deepening my understanding in my algorithms for an undirected graph vs. undirected graph problems on leetcode for example. The key difference I realized is for a p
