Topic: graph-theory-problem / Level: intermediate

• 1851. Implement an algorithm to check if a directed graph contains any cycles using the Floyd-Warshall algorithm.
• 1852. Write a program to find the number of simple cycles in a directed acyclic graph.
• 1853. Implement an algorithm to find the longest path that visits every vertex in a weighted directed graph.
• 1854. Write a program to calculate the average degree of vertices in a directed graph.
• 1855. Implement an algorithm to find all simple paths from a source to a target in a directed graph.
• 1856. Write a program to find the shortest path between two vertices in a bipartite graph using BFS.
• 1857. Implement an algorithm to check if two directed graphs are strongly isomorphic using adjacency matrices.
• 1858. Write a program to find all maximal cliques in a directed graph using dynamic programming.
• 1859. Implement an algorithm to check if a directed graph is a tree using properties of trees.
• 1860. Write a program to find the longest increasing path in a weighted directed graph.
• 1861. Implement an algorithm to find the number of edges in a minimum spanning tree using Prims algorithm.
• 1862. Write a program to check if a bipartite graph can be 3-colored using DFS.
• 1863. Implement an algorithm to find the shortest path in a directed graph with negative weights using Bellman-Ford.
• 1864. Write a program to find the longest path between two nodes in a bipartite graph.
• 1865. Implement an algorithm to calculate the number of edges in a directed graph that do not form a cycle.
• 1866. Write a program to find all paths of length k in a bipartite graph using DFS.
• 1867. Implement an algorithm to check if a directed graph contains any cycles using Kahns algorithm.
• 1868. Write a program to find the number of edges in a bipartite graph that form a path.
• 1869. Implement an algorithm to find the longest simple path in a weighted bipartite graph.
• 1870. Write a program to find the shortest cycle in a directed graph using dynamic programming.
• 1871. Implement an algorithm to check if a directed graph is strongly connected using DFS.
• 1872. Write a program to find the longest path that visits every edge in a directed graph.
• 1873. Implement an algorithm to find all edges in a directed graph that form a cycle.
• 1874. Write a program to check if a directed graph can be 3-colored using adjacency lists.
• 1875. Implement an algorithm to find the number of paths from a source to a target in a weighted directed graph.
• 1876. Write a program to check if a bipartite graph is k-colorable.
• 1877. Implement an algorithm to find the longest path in a directed acyclic graph using dynamic programming.
• 1878. Write a program to find the number of edges in a bipartite graph that do not form a cycle.
• 1879. Implement an algorithm to find the maximum weight independent set in a bipartite graph using dynamic programming.
• 1880. Write a program to find the longest path between two vertices in a directed graph.
• 1881. Implement an algorithm to check if a directed graph can be made bipartite.
• 1882. Write a program to find the number of edges in a minimum spanning tree using Kruskal’s algorithm.
• 1883. Implement an algorithm to find the longest increasing subsequence in a weighted directed graph.
• 1884. Write a program to check if a directed graph is a valid topological sort using the in-degree method.
• 1885. Implement an algorithm to find all maximal independent sets in a bipartite graph using backtracking.
• 1886. Write a program to calculate the average distance from a source vertex to all other vertices in a directed graph.
• 1887. Implement an algorithm to find all paths of length k between two vertices in a directed graph.
• 1888. Write a program to find the maximum flow in a directed graph using the Push-Relabel algorithm.
• 1889. Implement an algorithm to find the shortest path in a directed graph using Dijkstras algorithm.
• 1890. Write a program to find the number of spanning trees in a bipartite graph using the Matrix Tree Theorem.
• 1891. Implement an algorithm to check if a bipartite graph can be colored with two colors using BFS.
• 1892. Write a program to find the longest increasing subsequence in a bipartite graph.
• 1893. Implement an algorithm to find all simple paths from a source to a target in a directed graph.
• 1894. Write a program to check if a directed graph is a valid topological sort.
• 1895. Implement an algorithm to find the shortest path between two vertices in a bipartite graph.
• 1896. Write a program to find all maximal cliques in a directed graph using DFS.
• 1897. Implement an algorithm to calculate the number of edges in a bipartite graph.
• 1898. Write a program to find the longest path in a weighted directed graph using dynamic programming.
• 1899. Implement an algorithm to check if a directed graph contains any articulation points using DFS.
• 1900. Write a program to calculate the maximum flow in a directed graph using the Ford-Fulkerson method.

• More Levels

• Beginner
• Advanced