← Back to Google

Graph Theory

20 questions

1Minimum Number of Vertices to Reach All NodesMedium
Graph Theory
Solve →
2Minimum Weighted Subgraph With the Required PathsHard
Graph TheoryHeap (Priority Queue)Shortest Path
Solve →
3Parallel CoursesMedium
Graph TheoryTopological Sort
Solve →
4All Paths from Source Lead to DestinationMedium
Graph TheoryTopological Sort
Solve →
5Modify Graph Edge WeightsHard
Graph TheoryHeap (Priority Queue)Shortest Path
Solve →
6Find Center of Star GraphEasy
Graph Theory
Solve →
7Minimum Number of Vertices to Reach All NodesMedium
Graph Theory
Solve →
8Find Champion IIMedium
Graph Theory
Solve →
9Paths in Maze That Lead to Same RoomMedium
Graph Theory
Solve →
10Minimum Cost Path with Edge ReversalsMedium
Graph TheoryHeap (Priority Queue)Shortest Path
Solve →
11Minimum Weighted Subgraph With the Required PathsHard
Graph TheoryHeap (Priority Queue)Shortest Path
Solve →
12Minimum Number of Vertices to Reach All NodesMedium
Graph Theory
Solve →
13Parallel CoursesMedium
Graph TheoryTopological Sort
Solve →
14All Paths from Source Lead to DestinationMedium
Graph TheoryTopological Sort
Solve →
15Find Champion IIMedium
Graph Theory
Solve →
16Minimum Cost Path with Edge ReversalsMedium
Graph TheoryHeap (Priority Queue)Shortest Path
Solve →
17Paths in Maze That Lead to Same RoomMedium
Graph Theory
Solve →
18Find Center of Star GraphEasy
Graph Theory
Solve →
19Modify Graph Edge WeightsHard
Graph TheoryHeap (Priority Queue)Shortest Path
Solve →
20Reachable Nodes In Subdivided GraphHard
Graph TheoryHeap (Priority Queue)Shortest Path
Solve →