Tag: depth-first-search
- All Ancestors of a Node in a Directed Acyclic Graph
- Count the Number of Complete Components
- Count Unreachable Pairs of Nodes in an Undirected Graph
- Course Schedule II
- Course Schedule IV
- Course Schedule
- Cracking the Safe
- Critical Connections in a Network
- Divide Nodes Into the Maximum Number of Groups
- Find All People With Secret
- Find Closest Node to Given Two Nodes
- Find Edges in Shortest Paths
- Find Eventual Safe States
- Find if Path Exists in Graph
- Flower Planting With No Adjacent
- Keys and Rooms
- Lexicographical Numbers
- Longest Cycle in a Graph
- Maximum Employees to Be Invited to a Meeting
- Minimum Height Trees
- Minimum Score of a Path Between Two Cities
- Network Delay Time
- Number of Operations to Make Network Connected
- Number of Provinces
- Possible Bipartition
- Reconstruct Itinerary
- Redundant Connection II
- Redundant Connection
- Remove Methods From Project
- Reorder Routes to Make All Paths Lead to the City Zero
- Sort Items by Groups Respecting Dependencies
- Valid Arrangement of Pairs