Advanced Graphs

Master topological sorting (Kahn's BFS and DFS post-order) for dependency ordering and cycle detection in directed graphs, plus Union-Find (Disjoint Set Union) with path compression and union by rank for connected components, cycle detection in undirected graphs, and element grouping.