LeetCode 1579 - Remove Max Number of Edges to Keep Graph Fully Traversible - Java

Solution, explanation, and complexity analysis for LeetCode 1579 in Java
Problem Description:
leetcode.com/problems/remove-...
Code:
github.com/AnatoliySokolov98/...

[@GelfandTransform]

Very nice explanation! And cool art in the thumb nail. I need to think about why, when generating a spanning tree, the method of first choosing type 3 edges when possible, and then secondarily choosing type 1 & 2 edges, always gives the maximal number of edges that can be removed.