Topic: graph-theory-problem / Level: intermediate

• 1951. Implement an algorithm to find the longest cycle in a directed bipartite graph.
• 1952. Write a program to calculate the distance between all pairs of vertices in a bipartite graph.
• 1953. Implement an algorithm to find the shortest path between all pairs of vertices in a bipartite graph.
• 1954. Write a program to check if a directed graph can be colored with k colors using backtracking.
• 1955. Implement an algorithm to find the longest path in a directed acyclic graph using dynamic programming.
• 1956. Write a program to calculate the average degree of vertices in a weighted directed graph.
• 1957. Implement an algorithm to find the number of paths in a bipartite graph.
• 1958. Write a program to check if a directed graph is a valid topological sort using DFS and adjacency lists.
• 1959. Implement an algorithm to find the longest increasing subsequence in a directed acyclic graph.
• 1960. Write a program to find all Hamiltonian paths in a directed graph using backtracking.
• 1961. Implement an algorithm to calculate the distance from a source vertex to all other vertices in a weighted graph.
• 1962. Write a program to find the shortest path that visits every edge in a directed graph.
• 1963. Implement an algorithm to check if two directed graphs are equivalent using adjacency lists.
• 1964. Write a program to find the maximum matching in a bipartite graph using the Hopcroft-Karp algorithm.
• 1965. Implement an algorithm to find the longest simple cycle in a directed graph.
• 1966. Write a program to check if a bipartite graph contains any simple paths.
• 1967. Implement an algorithm to calculate the number of edges in a directed graph.
• 1968. Write a program to find the longest path that visits every vertex in a directed graph.
• 1969. Implement an algorithm to check if a directed graph contains any cycles using Tarjans algorithm.
• 1970. Write a program to calculate the number of edges in a bipartite graph that do not form a cycle.
• 1971. Implement an algorithm to find the longest increasing path in a bipartite graph.
• 1972. Write a program to find all paths from a source vertex to a target in a weighted directed graph.
• 1973. Implement an algorithm to check if a directed graph is Eulerian using adjacency matrices.
• 1974. Write a program to find the maximum flow in a directed graph using the Ford-Fulkerson method.
• 1975. Implement an algorithm to find the longest path between two nodes in a weighted directed graph.
• 1976. Write a program to check if a directed graph can be colored with three colors using adjacency lists.
• 1977. Implement an algorithm to find the number of edges in a minimum spanning tree using Prims algorithm.
• 1978. Write a program to calculate the longest path that visits every vertex in a directed acyclic graph.
• 1979. Implement an algorithm to check if a bipartite graph contains any back edges using DFS.
• 1980. Write a program to find the longest simple path in a bipartite graph using dynamic programming.
• 1981. Implement an algorithm to calculate the total number of paths in a directed bipartite graph.
• 1982. Write a program to find the longest increasing subsequence in a weighted directed graph.
• 1983. Implement an algorithm to check if two directed graphs are isomorphic using adjacency lists.
• 1984. Write a program to find the longest path in a weighted graph using backtracking.
• 1985. Implement an algorithm to find the minimum number of edges to add to make a directed graph strongly connected.
• 1986. Write a program to calculate the number of edge-disjoint paths in a bipartite graph.
• 1987. Implement an algorithm to find all Hamiltonian cycles in a bipartite graph using dynamic programming.
• 1988. Write a program to check if a directed graph can be made bipartite.
• 1989. Implement an algorithm to find the longest simple cycle in a weighted graph using DFS.
• 1990. Write a program to find the shortest path between all pairs of vertices in a directed graph using the Floyd-Warshall algorithm.
• 1991. Implement an algorithm to find the longest increasing path in a weighted directed graph.
• 1992. Write a program to check if a bipartite graph is k-colorable.
• 1993. Implement an algorithm to find the longest path in a bipartite graph using dynamic programming.
• 1994. Write a program to check if a directed graph contains any cycles using Kahns algorithm.
• 1995. Implement an algorithm to find all paths of length k in a weighted bipartite graph.
• 1996. Write a program to calculate the maximum flow in a bipartite graph using the Ford-Fulkerson method.
• 1997. Implement an algorithm to check if a bipartite graph can be colored with two colors using adjacency lists.
• 1998. Write a program to find the number of edges in a directed graph that form a cycle.
• 1999. Implement an algorithm to find the longest path that visits every vertex in a weighted directed graph.

• More Levels

• Beginner
• Advanced