1Course ScheduleMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 2Possible BipartitionMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 3Course ScheduleMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 4Course ScheduleMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 5Possible BipartitionMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 6Course Schedule IIMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 7Course ScheduleMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 8Possible BipartitionMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 9Reorder Routes to Make All Paths Lead to the City ZeroMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 10Course Schedule IVMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 11Is Graph Bipartite?MediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 12Graph Valid TreeMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 13Number of Connected Components in an Undirected GraphMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 14Course Schedule IIMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 15Course ScheduleMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 16Possible BipartitionMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 17Reorder Routes to Make All Paths Lead to the City ZeroMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 18Course Schedule IVMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 19Is Graph Bipartite?MediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 20Number of Connected Components in an Undirected GraphMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 21Graph Valid TreeMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve →