Graph Theory Practice

Practice graph representation, traversal, connectivity, paths, and related algorithms through 34 problems, ordered from GRAPH01 to GRAPH34.

Problems

# Problem Points AC Rate Users
1 Edge List to Adjacency Lists 100 0.0% 0
2 Adjacency Lists to an Edge List 100 0.0% 0
3 Directed Edge List to Adjacency Lists 100 0.0% 0
4 Edge List to an Adjacency Matrix 100 0.0% 0
5 Adjacency Matrix to an Edge List 100 0.0% 0
6 Adjacency Matrix to Adjacency Lists 100 0.0% 0
7 Adjacency Lists to an Adjacency Matrix 100 0.0% 0
8 Weighted Matrix to an Edge List 100 0.0% 0
9 Depth-First Search of an Undirected Graph 100 0.0% 0
10 Depth-First Search of a Directed Graph 100 0.0% 0
11 Breadth-First Search of an Undirected Graph 100 0.0% 0
12 Breadth-First Search of a Directed Graph 100 0.0% 0
13 Count Connected Components 100 0.0% 0
14 A DFS Path in an Undirected Graph 100 0.0% 0
15 A Shortest Path in an Undirected Graph 100 0.0% 0
16 A DFS Path in a Directed Graph 100 0.0% 0
17 A Shortest Path in a Directed Graph 100 0.0% 0
18 Reachability Queries 100 0.0% 0
19 Count Articulation Points 100 0.0% 0
20 Count Bridges 100 0.0% 0
21 Cycle in an Undirected Graph 100 0.0% 0
22 Cycle in a Directed Graph 100 0.0% 0
23 Strong Connectivity 100 0.0% 0
24 Is It a Tree? 100 0.0% 0
25 Breadth-First Traversal 100 0.0% 0
26 Shortest Number of Roads 100 0.0% 0
27 Counting Rooms 100 0.0% 0
28 Build Roads 100 0.0% 0
29 Largest Friend Group 100 0.0% 0
30 Choose Group Leaders 100 0.0% 0
31 Shortest Path in a Maze 100 0.0% 0
32 Knight Path on a Blocked Board 100 0.0% 0
33 Connect Ropes with Minimum Cost 100 0.0% 0
34 Minimum String Value 100 0.0% 0

Comments

There are no comments at the moment.