Topic: graph-theory-problem / Level: beginner

• 101. Implement a function to detect if a graph contains any cycles using BFS.
• 102. Write a program to find the shortest path in a weighted graph using BFS.
• 103. Implement a function to find the eccentricity of all nodes in a graph.
• 104. Write a program to find all spanning trees in an undirected graph.
• 105. Implement a program to check if a graph is k-regular.
• 106. Write a function to find the total number of distinct paths in a graph.
• 107. Implement a program to find all vertices with odd degrees in a graph.
• 108. Write a function to find all nodes reachable from a given node using BFS.
• 109. Implement a program to find the shortest path in a graph with non-negative weights.
• 110. Write a function to print all vertices of a graph in lexicographical order.
• 111. Implement a function to find the maximum matching in a bipartite graph.
• 112. Write a program to check if a given graph is acyclic.
• 113. Implement a function to find the chromatic number of a graph.
• 114. Write a program to check if a given graph contains any cut vertices.
• 115. Implement a function to print the adjacency matrix of a graph.
• 116. Write a program to check if two graphs are isomorphic.
• 117. Implement a function to find the spanning tree with the fewest edges.
• 118. Write a function to print all edge-disjoint paths in a graph.
• 119. Implement a program to check if a directed graph contains a Hamiltonian path.
• 120. Write a function to find the maximum flow between two vertices in a flow network.
• 121. Implement a program to find the longest cycle in a graph.
• 122. Write a program to find the minimum number of edges to remove to make a graph acyclic.
• 123. Implement a function to find the number of reachable nodes from a given vertex using DFS.
• 124. Write a program to count the number of distinct cycles in an undirected graph.
• 125. Implement a function to find the shortest path in a graph with negative edge weights using Bellman-Ford.
• 126. Write a function to check if a graph has a strongly connected component.
• 127. Implement a program to find the maximum independent set in a graph.
• 128. Write a function to check if a graph is chordal.
• 129. Implement a program to check if a graph is transitively reduced.
• 130. Write a program to print the adjacency list of a graph.
• 131. Implement a function to find the number of connected components in a directed graph.
• 132. Write a function to check if a given undirected graph is connected.
• 133. Implement a program to perform DFS on a directed acyclic graph (DAG).
• 134. Write a function to print all cycles in a directed graph.
• 135. Implement a program to calculate the size of the largest strongly connected component in a directed graph.
• 136. Write a program to check if an edge is a cut edge in an undirected graph.
• 137. Implement a function to check if two nodes are in the same connected component.
• 138. Write a program to find the maximum bipartite matching using DFS.
• 139. Implement a function to check if a directed graph has any self-loops.
• 140. Write a program to find the number of trees in a forest.
• 141. Implement a function to check if a graph is a tree.
• 142. Write a program to find all the edges of a graph.
• 143. Implement a function to find the number of bridges in a directed graph.
• 144. Write a program to print all connected components in an undirected graph.
• 145. Implement a function to check if a graph is weakly connected.
• 146. Write a program to check if a graph is complete.
• 147. Implement a function to print the topological order of a DAG.
• 148. Write a program to find the number of vertices with degree one.
• 149. Implement a function to check if two vertices are in the same strongly connected component.
• 150. Write a program to print all vertices in decreasing order of their degrees.

• More Levels

• Intermediate
• Advanced