Graph
Biconnected Component¶
Eulerian Circuit¶
Minimum Spanning Tree¶
- 1724. Checking Existence of Edge Length Limited Paths II
- 1584. Min Cost to Connect All Points
- 1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
- 1168. Optimize Water Distribution in a Village
- 1135. Connecting Cities With Minimum Cost
Shortest Path¶
- 3419. Minimize the Maximum Edge Weight of Graph
- 3377. Digit Operations to Make Two Integers Equal
- 3342. Find Minimum Time to Reach Last Room II
- 3341. Find Minimum Time to Reach Last Room I
- 3286. Find a Safe Walk Through a Grid
- 3123. Find Edges in Shortest Paths
- 3112. Minimum Time to Visit Disappearing Nodes
- 2977. Minimum Cost to Convert String II
- 2976. Minimum Cost to Convert String I
- 2959. Number of Possible Sets of Closing Branches
- 2737. Find the Closest Marked Node
- 2714. Find Shortest Path with K Hops
- 2699. Modify Graph Edge Weights
- 2662. Minimum Cost of a Path With Special Roads
- 2642. Design Graph With Shortest Path Calculator
- 2577. Minimum Time to Visit a Cell In a Grid
- 2473. Minimum Cost to Buy Apples
- 2297. Jump Game VIII
- 2290. Minimum Obstacle Removal to Reach Corner
- 2203. Minimum Weighted Subgraph With the Required Paths
- 2093. Minimum Cost to Reach City With Discounts
- 2045. Second Minimum Time to Reach Destination
- 1976. Number of Ways to Arrive at Destination
- 1810. Minimum Path Cost in a Hidden Grid
- 1786. Number of Restricted Paths From First to Last Node
- 1514. Path with Maximum Probability
- 1368. Minimum Cost to Make at Least One Valid Path in a Grid
- 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance
- 882. Reachable Nodes In Subdivided Graph
- 787. Cheapest Flights Within K Stops
- 743. Network Delay Time
- 505. The Maze II
- 499. The Maze III
- 399. Evaluate Division
Strongly Connected Component¶
- 1568. Minimum Number of Days to Disconnect Island
- 1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
Topological Sort¶
- 3530. Maximum Profit from Valid Topological Order in DAG
- 3481. Apply Substitutions
- 3435. Frequencies of Shortest Supersequences
- 3383. Minimum Runes to Add to Cast Spell
- 2876. Count Visited Nodes in a Directed Graph
- 2603. Collect Coins in a Tree
- 2392. Build a Matrix With Conditions
- 2371. Minimize Maximum Value in a Grid
- 2360. Longest Cycle in a Graph
- 2328. Number of Increasing Paths in a Grid
- 2246. Longest Path With Different Adjacent Characters
- 2204. Distance to a Cycle in Undirected Graph
- 2192. All Ancestors of a Node in a Directed Acyclic Graph
- 2127. Maximum Employees to Be Invited to a Meeting
- 2115. Find All Possible Recipes from Given Supplies
- 2050. Parallel Courses III
- 1976. Number of Ways to Arrive at Destination
- 1916. Count Ways to Build Rooms in an Ant Colony
- 1857. Largest Color Value in a Directed Graph
- 1786. Number of Restricted Paths From First to Last Node
- 1728. Cat and Mouse II
- 1632. Rank Transform of a Matrix
- 1591. Strange Printer II
- 1462. Course Schedule IV
- 1245. Tree Diameter
- 1203. Sort Items by Groups Respecting Dependencies
- 1136. Parallel Courses
- 1059. All Paths from Source Lead to Destination
- 913. Cat and Mouse
- 851. Loud and Rich
- 802. Find Eventual Safe States
- 631. Design Excel Sum Formula
- 444. Sequence Reconstruction
- 329. Longest Increasing Path in a Matrix
- 310. Minimum Height Trees
- 269. Alien Dictionary
- 210. Course Schedule II
- 207. Course Schedule