Topic: graph-theory-problem / Level: intermediate

• 1901. Implement an algorithm to find all Hamiltonian cycles in a bipartite graph using dynamic programming.
• 1902. Write a program to find the number of paths of length k in a weighted graph.
• 1903. Implement an algorithm to check if a directed graph can be partitioned into two disjoint subsets.
• 1904. Write a program to find the longest path that visits every vertex in a directed acyclic graph.
• 1905. Implement an algorithm to find the number of edges in a minimum spanning tree using Prims algorithm with a priority queue.
• 1906. Write a program to check if a bipartite graph contains any cycles using the DFS approach.
• 1907. Implement an algorithm to find the longest increasing path in a bipartite graph using dynamic programming.
• 1908. Write a program to calculate the number of paths from a source to a target in a bipartite graph.
• 1909. Implement an algorithm to find the longest simple path in a directed graph.
• 1910. Write a program to check if a directed graph contains any cycles using the Floyd-Warshall algorithm.
• 1911. Implement an algorithm to calculate the maximum flow in a bipartite graph using the Ford-Fulkerson method.
• 1912. Write a program to find the shortest path between two vertices in a directed graph using Dijkstras algorithm.
• 1913. Implement an algorithm to check if a bipartite graph is 2-colorable using adjacency lists.
• 1914. Write a program to calculate the number of edges in a directed graph that do not form a cycle.
• 1915. Implement an algorithm to find the longest increasing path in a directed graph.
• 1916. Write a program to find all articulation points in a weighted graph using the Tarjan algorithm.
• 1917. Implement an algorithm to find the longest path in a weighted bipartite graph.
• 1918. Write a program to check if a directed graph is a valid topological sort using DFS.
• 1919. Implement an algorithm to find the maximum weight independent set in a directed graph.
• 1920. Write a program to calculate the total number of paths in a directed acyclic graph.
• 1921. Implement an algorithm to check if a directed graph contains any back edges using Kahns algorithm.
• 1922. Write a program to find the longest path in a tree using dynamic programming.
• 1923. Implement an algorithm to find the minimum cut in a directed graph using the Max-Flow Min-Cut Theorem.
• 1924. Write a program to find the number of simple cycles in a bipartite graph.
• 1925. Implement an algorithm to find the longest path in a weighted directed graph using dynamic programming.
• 1926. Write a program to check if a bipartite graph can be colored with three colors.
• 1927. Implement an algorithm to find all paths from a source vertex in a directed graph using DFS.
• 1928. Write a program to check if a directed graph can be made strongly connected by adding edges.
• 1929. Implement an algorithm to calculate the number of paths of length k in a directed graph.
• 1930. Write a program to find all maximal independent sets in a weighted directed graph.
• 1931. Implement an algorithm to find the shortest path between two vertices in a weighted graph using Dijkstras algorithm.
• 1932. Write a program to check if a directed graph is Eulerian using Fleurys algorithm.
• 1933. Implement an algorithm to find the longest simple path that visits each vertex at least once in a directed graph.
• 1934. Write a program to find the number of edges in a bipartite graph that form a cycle.
• 1935. Implement an algorithm to calculate the average path length in a bipartite graph.
• 1936. Write a program to find the maximum flow in a weighted bipartite graph.
• 1937. Implement an algorithm to check if a directed graph is strongly connected using Kosaraju’s algorithm.
• 1938. Write a program to find the longest increasing path in a weighted graph.
• 1939. Implement an algorithm to check if a bipartite graph can be partitioned into two equal subsets.
• 1940. Write a program to find the maximum number of vertex-disjoint paths in a weighted directed graph.
• 1941. Implement an algorithm to find the longest path that visits every edge in a bipartite graph.
• 1942. Write a program to check if a directed graph contains any articulation points using DFS.
• 1943. Implement an algorithm to find all simple cycles in a directed bipartite graph using DFS.
• 1944. Write a program to calculate the number of spanning trees in a directed bipartite graph.
• 1945. Implement an algorithm to find the longest simple path in a directed graph using dynamic programming.
• 1946. Write a program to find all paths from a source to a target in a weighted directed graph.
• 1947. Implement an algorithm to check if a bipartite graph can be colored with four colors.
• 1948. Write a program to find the maximum flow in a directed graph using the Push-Relabel method.
• 1949. Implement an algorithm to find the number of edge-disjoint paths in a directed graph.
• 1950. Write a program to check if a bipartite graph contains any back edges.

• More Levels

• Beginner
• Advanced