Topic: graph-theory-problem / Level: advanced

• 2050. Implement an algorithm to find all simple paths in a weighted graph.
• 2051. Write a program to find the number of Hamiltonian paths in a bipartite graph.
• 2052. Implement an algorithm to check if a directed graph can be strongly connected by adding edges.
• 2053. Write a program to compute the transitive reduction of a directed graph.
• 2054. Implement an algorithm to find the longest increasing subsequence in a directed acyclic graph.
• 2055. Write a program to check if a bipartite graph contains any cycles.
• 2056. Implement an algorithm to find the shortest cycle in a directed graph using dynamic programming.
• 2057. Write a program to determine if a bipartite graph can be partitioned into two equal subsets.
• 2058. Implement an algorithm to find all paths of length k between two vertices in a directed graph.
• 2059. Write a program to find the diameter of a tree using two BFS/DFS traversals.
• 2060. Implement an algorithm to calculate the number of edge-disjoint spanning trees in a weighted graph.
• 2061. Write a program to check if a directed graph is a valid topological sort.
• 2062. Implement an algorithm to find the longest path that visits each vertex at least once in a directed graph.
• 2063. Write a program to solve the "Multi-Commodity Flow Problem" in a graph.
• 2064. Implement an algorithm to calculate the maximum flow using the preflow-push algorithm.
• 2065. Write a program to find all articulation points in a weighted graph.
• 2066. Implement an algorithm to check if a directed graph is strongly connected using Tarjan’s algorithm.
• 2067. Write a program to find the maximum number of vertex-disjoint paths in a weighted graph.
• 2068. Implement an algorithm to solve the "Vertex Cover Problem" in a bipartite graph.
• 2069. Write a program to find the longest path that visits every edge of a bipartite graph.
• 2070. Implement an algorithm to check if a directed graph contains a unique path between any two vertices.
• 2071. Write a program to compute the minimum cost flow in a flow network using linear programming.
• 2072. Implement an algorithm to find the longest path in a graph using dynamic programming.
• 2073. Write a program to find all paths from a source vertex to all other vertices in a weighted directed graph.
• 2074. Implement an algorithm to check if two directed graphs are isomorphic using their adjacency matrices.
• 2075. Write a program to find the minimum number of edges required to make a bipartite graph Eulerian.
• 2076. Implement an algorithm to calculate the number of maximal cliques in a directed graph.
• 2077. Write a program to solve the "Steiner Tree Problem" in a directed graph.
• 2078. Implement an algorithm to find the longest path in a tree using dynamic programming.
• 2079. Write a program to find all Hamiltonian cycles in a weighted directed graph.
• 2080. Implement an algorithm to check if a directed graph is a valid topological sort using the in-degree method.
• 2081. Write a program to calculate the maximum flow in a directed graph using Dinics algorithm.
• 2082. Implement an algorithm to check if a directed graph is bipartite using DFS.
• 2083. Write a program to find the shortest path from a source vertex to all other vertices in a directed bipartite graph.
• 2084. Implement an algorithm to calculate the number of edge-disjoint paths in a bipartite graph.
• 2085. Write a program to check if a directed graph is a valid tree using properties of trees.
• 2086. Implement an algorithm to find the longest path that visits each vertex at least once in a bipartite graph.
• 2087. Write a program to solve the "Graph Coloring Problem" using backtracking and dynamic programming.
• 2088. Implement an algorithm to find the number of spanning trees in a directed graph using Kirchhoff’s theorem.
• 2089. Write a program to find all maximal independent sets in a directed acyclic graph using backtracking.
• 2090. Implement an algorithm to check if a bipartite graph is k-colorable using a greedy approach.
• 2091. Write a program to find the shortest path in a directed graph with both positive and negative weights.
• 2092. Implement an algorithm to calculate the number of simple cycles in a directed bipartite graph.
• 2093. Write a program to find the longest increasing path in a weighted graph.
• 2094. Implement an algorithm to check if two directed graphs are equivalent using adjacency lists.
• 2095. Write a program to find the longest path between two nodes in a bipartite graph.
• 2096. Implement an algorithm to calculate the distance between all pairs of vertices in a weighted graph.
• 2097. Write a program to find the longest path that visits every vertex in a weighted bipartite graph.
• 2098. Implement an algorithm to solve the "Maximum Flow with Minimum Cost" problem in a graph.
• 2099. Write a program to find the maximum flow in a directed graph using the Edmonds-Karp algorithm.

• More Levels

• Beginner
• Intermediate