Topic: graph-theory-problem / Level: advanced

• 2100. Implement the Tarjans algorithm to find all strongly connected components in a directed graph.
• 2101. Write a program to calculate the number of ways to color a graph with k colors.
• 2102. Implement an algorithm to check if a bipartite graph contains any odd-length cycles.
• 2103. Write a program to find the longest path in a directed graph with unit weights.
• 2104. Implement an algorithm to solve the "Maximum Matching Problem" in a bipartite graph using the Hungarian method.
• 2105. Write a program to find the number of Hamiltonian cycles in a bipartite graph.
• 2106. Implement an algorithm to calculate the minimum distance between any two nodes in a directed graph.
• 2107. Write a program to find the shortest path from a source to a sink in a flow network.
• 2108. Implement an algorithm to find all simple paths in a directed graph using backtracking.
• 2109. Write a program to check if a graph is a tree using properties of trees.
• 2110. Implement an algorithm to calculate the degree of each vertex in a directed graph.
• 2111. Write a program to find all paths of a given length k in a directed graph.
• 2112. Implement an algorithm to find the longest cycle in a bipartite graph.
• 2113. Write a program to check if a bipartite graph is complete using adjacency matrices.
• 2114. Implement an algorithm to find the number of spanning trees in a bipartite graph using the Matrix Tree Theorem.
• 2115. Write a program to solve the "Chinese Remainder Theorem" using graph techniques.
• 2116. Implement an algorithm to find the longest simple path in a weighted bipartite graph.
• 2117. Write a program to calculate the distance between all pairs of vertices in a bipartite graph.
• 2118. Implement an algorithm to check if a bipartite graph contains any cycles using the DFS approach.
• 2119. Write a program to find the longest path that visits every vertex in a directed acyclic graph.
• 2120. Implement an algorithm to calculate the number of edges in a minimum spanning tree using Prims algorithm with a priority queue.
• 2121. Write a program to find the longest increasing path in a weighted directed graph.
• 2122. Implement an algorithm to find all Hamiltonian paths in a directed graph using dynamic programming.
• 2123. Write a program to check if a directed graph contains any cycles using the Floyd-Warshall algorithm.
• 2124. Implement an algorithm to find the longest path that visits each edge at least once in a directed graph.
• 2125. Write a program to find the minimum spanning tree in a graph with both positive and negative edges using Kruskal’s algorithm.
• 2126. Implement an algorithm to check if two directed graphs are isomorphic using the adjacency list representation.
• 2127. Write a program to find all maximal independent sets in a directed graph.
• 2128. Implement an algorithm to calculate the number of edge-disjoint paths in a directed bipartite graph.
• 2129. Write a program to find the shortest path from a source vertex to all other vertices in a directed graph.
• 2130. Implement an algorithm to check if a directed graph is strongly connected using Kosarajus algorithm.
• 2131. Write a program to find the longest path in a weighted bipartite graph using dynamic programming.
• 2132. Implement an algorithm to calculate the average degree of vertices in a directed bipartite graph.
• 2133. Write a program to find the number of simple cycles in a directed graph using dynamic programming.
• 2134. Implement an algorithm to check if a bipartite graph contains any simple paths using backtracking.
• 2135. Write a program to find the longest increasing path in a bipartite graph.
• 2136. Implement an algorithm to check if a directed graph contains any cycles using Kahns algorithm.
• 2137. Write a program to find the number of edges in a bipartite graph that form a path.
• 2138. Implement an algorithm to find all paths from a source vertex in a directed graph.
• 2139. Write a program to find the shortest path in a directed graph with negative weights using Bellman-Ford.
• 2140. Implement an algorithm to check if a directed graph is a valid topological sort using the in-degree method.
• 2141. Write a program to find the longest path in a weighted graph using dynamic programming.
• 2142. Implement an algorithm to calculate the maximum flow in a directed graph using augmenting paths.
• 2143. Write a program to find the maximum matching in a general graph using the Hopcroft-Karp algorithm.
• 2144. Implement an algorithm to find all articulation points in a directed graph using DFS.
• 2145. Write a program to find the longest path in a directed acyclic graph using dynamic programming.
• 2146. Implement an algorithm to check if a directed graph is bipartite using BFS.
• 2147. Write a program to find all paths of length k in a directed graph using DFS.
• 2148. Implement an algorithm to calculate the number of edges in a minimum spanning tree using Kruskal’s algorithm.
• 2149. Write a program to find the number of Hamiltonian paths in a weighted bipartite graph.

• More Levels

• Beginner
• Intermediate