Topic: graph-theory-problem / Level: beginner

• 151. Implement a function to check if a directed graph is strongly connected.
• 152. Write a program to check if two graphs have the same degree sequence.
• 153. Implement a function to find the longest simple cycle in an undirected graph.
• 154. Write a program to calculate the degree centrality of each vertex in a graph.
• 155. Implement a function to find the edge-connectivity of a graph.
• 156. Write a program to find the vertex-connectivity of a graph.
• 157. Implement a function to check if a graph is connected after removing a vertex.
• 158. Write a program to find the minimum vertex cover of a graph.
• 159. Implement a function to find the shortest Hamiltonian path in a DAG.
• 160. Write a program to print all edge-disjoint cycles in a graph.
• 161. Implement a function to find the minimum cut in an undirected graph.
• 162. Write a program to check if a directed graph is semi-connected.
• 163. Implement a function to check if a graph is Eulerian.
• 164. Write a program to find the minimum spanning forest of a graph.
• 165. Implement a function to check if a graph contains a perfect matching.
• 166. Write a program to print all strongly connected components of a directed graph.
• 167. Implement a function to find the smallest cycle in an undirected graph.
• 168. Write a program to find all minimum spanning trees of a graph.
• 169. Implement a function to check if a graph is 2-connected.
• 170. Write a program to find the diameter of a graph using DFS.
• 171. Implement a function to find the radius of a directed graph.
• 172. Write a program to find the shortest path in a weighted directed acyclic graph.
• 173. Implement a function to find the maximum cut of a graph.
• 174. Write a program to find the shortest Hamiltonian cycle in a graph.
• 175. Implement a function to find the minimum edge cut in a directed graph.
• 176. Write a program to find the number of edges in a minimum spanning tree.
• 177. Implement a function to check if a directed graph is acyclic.
• 178. Write a program to check if two graphs are strongly isomorphic.
• 179. Implement a function to find the longest simple path in a directed graph.
• 180. Write a program to find all spanning forests of an undirected graph.
• 181. Write a program to find the number of edges that can be removed without disconnecting a graph.
• 182. Implement a function to find the minimum vertex cover in a bipartite graph.
• 183. Write a program to check if a given undirected graph is bipartite using BFS.
• 184. Implement a function to check if a graph has a perfect matching.
• 185. Write a program to find the shortest cycle in an undirected graph using BFS.
• 186. Implement a function to print all edges of a graph.
• 187. Write a program to print all paths between two nodes in an undirected graph.
• 188. Implement a function to check if two graphs have the same adjacency matrix.
• 189. Write a program to print all edges in lexicographical order.
• 190. Implement a function to perform a DFS traversal in an undirected graph starting from a given node.
• 191. Write a program to check if an undirected graph contains any odd-length cycles.
• 192. Implement a function to find the maximum degree of any vertex in a directed graph.
• 193. Write a program to check if a graph has an Eulerian path.
• 194. Implement a function to find the shortest path between two nodes in a graph with positive weights.
• 195. Write a program to count the number of edges in a graph using the adjacency matrix.
• 196. Implement a function to print all strongly connected components using Kosaraju’s algorithm.
• 197. Write a program to find the shortest path between all pairs of nodes in an undirected graph.
• 198. Implement a function to check if a graph is planar using Kuratowskis theorem.
• 199. Write a program to find the length of the shortest cycle in a directed graph.
• 200. Implement a function to count the number of connected subgraphs in a given undirected graph.

• More Levels

• Intermediate
• Advanced