| 133 | Clone Graph | Medium |
| 207 | Course Schedule | Medium |
| 210 | Course Schedule II | Medium |
| 332 | Reconstruct Itinerary | Hard |
| 785 | Is Graph Bipartite? | Medium |
| 787 | Cheapest Flights Within K Stops | Medium |
| 802 | Find Eventual Safe States | Medium |
| 997 | Find the Town Judge | Easy |
| 1042 | Flower Planting With No Adjacent | Medium |
| 1361 | Validate Binary Tree Nodes | Medium |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard |
| 1557 | Minimum Number of Vertices to Reach All Nodes | Medium |
| 1584 | Min Cost to Connect All Points | Medium |
| 1615 | Maximal Network Rank | Medium |
| 1719 | Number Of Ways To Reconstruct A Tree | Hard |
| 1761 | Minimum Degree of a Connected Trio in a Graph | Hard |
| 1971 | Find if Path Exists in Graph | Easy |
| 2050 | Parallel Courses III | Hard |
| 2092 | Find All People With Secret | Hard |
| 2192 | All Ancestors of a Node in a Directed Acyclic Graph | Medium |
| 2374 | Node With Highest Edge Score | Medium |
| 2642 | Design Graph With Shortest Path Calculator | Hard |