Topic: graph-theory-problem / Level: intermediate

• 1801. Implement an algorithm to find the longest path in a weighted directed graph using the Bellman-Ford algorithm.
• 1802. Write a program to calculate the number of edges in a minimum spanning tree of a directed graph.
• 1803. Implement an algorithm to find the longest path that visits every edge of a bipartite graph.
• 1804. Write a program to check if a directed graph is strongly connected using Tarjans algorithm.
• 1805. Implement an algorithm to find all the paths from a source to a target in a directed graph using DFS.
• 1806. Write a program to find the minimum number of edges required to make a bipartite graph Eulerian.
• 1807. Implement an algorithm to calculate the average degree of vertices in a directed bipartite graph.
• 1808. Write a program to find the number of spanning trees in a directed graph using DFS.
• 1809. Implement an algorithm to check if a directed graph is a directed tree using properties of directed graphs.
• 1810. Write a program to find the longest simple cycle in a directed bipartite graph.
• 1811. Implement an algorithm to find the maximum flow in a directed graph with unit capacities.
• 1812. Write a program to check if a bipartite graph can be colored with two colors using a BFS approach.
• 1813. Implement an algorithm to find all maximal cliques in a graph using the Bron-Kerbosch algorithm.
• 1814. Write a program to calculate the number of edges in a bipartite graph that do not form a cycle.
• 1815. Implement an algorithm to check if a graph is bipartite using adjacency matrices.
• 1816. Write a program to find the shortest path that visits every vertex in a bipartite graph.
• 1817. Implement an algorithm to check if a directed graph contains any simple cycles using Kahns algorithm.
• 1818. Write a program to calculate the distance from a source vertex to all other vertices in a directed graph using Dijkstras algorithm.
• 1819. Implement an algorithm to find the longest path in a weighted graph using dynamic programming.
• 1820. Write a program to find all the simple paths in a directed graph.
• 1821. Implement an algorithm to find the longest path between two nodes in a directed graph.
• 1822. Write a program to calculate the total number of paths in a directed acyclic graph.
• 1823. Implement an algorithm to check if a directed graph contains any cycles using DFS.
• 1824. Write a program to find the minimum number of edges to remove to make a directed graph acyclic.
• 1825. Implement an algorithm to find all articulation points in a weighted graph using DFS.
• 1826. Write a program to check if a graph is Eulerian using properties of Eulerian graphs.
• 1827. Implement an algorithm to calculate the number of edges in a minimum spanning tree using Kruskal’s algorithm.
• 1828. Write a program to find the longest simple path that visits all vertices in a graph.
• 1829. Implement an algorithm to find the number of edges in a bipartite graph that form a path.
• 1830. Write a program to check if a directed graph is a valid topological sort using DFS.
• 1831. Implement an algorithm to find all maximal independent sets in a bipartite graph using dynamic programming.
• 1832. Write a program to calculate the distance from a source vertex to all other vertices in a bipartite graph.
• 1833. Implement an algorithm to check if a bipartite graph can be colored with three colors using backtracking.
• 1834. Write a program to find the longest increasing path in a directed graph.
• 1835. Implement an algorithm to find the number of edge-disjoint paths in a weighted directed graph.
• 1836. Write a program to check if two directed graphs are isomorphic using adjacency matrices.
• 1837. Implement an algorithm to find the maximum weight matching in a directed bipartite graph.
• 1838. Write a program to calculate the number of strongly connected components in a directed graph using Kosarajus algorithm.
• 1839. Implement an algorithm to find the longest path in a directed acyclic graph using dynamic programming.
• 1840. Write a program to check if a bipartite graph contains any cycles using the DFS approach.
• 1841. Implement an algorithm to find the shortest path between two vertices in a bipartite graph.
• 1842. Write a program to calculate the average distance from a source vertex to all other vertices in a weighted graph.
• 1843. Implement an algorithm to find all Hamiltonian paths in a directed bipartite graph.
• 1844. Write a program to check if a directed graph contains any back edges using Kahns algorithm.
• 1845. Implement an algorithm to find the minimum spanning tree using Prims algorithm with a priority queue.
• 1846. Write a program to find the number of edge-disjoint spanning trees in a weighted directed graph.
• 1847. Implement an algorithm to check if a directed graph can be made strongly connected by adding edges.
• 1848. Write a program to calculate the distance from a source vertex to all other vertices in a directed bipartite graph.
• 1849. Implement an algorithm to find the maximum flow in a directed graph using augmenting paths.
• 1850. Write a program to find the longest simple cycle in a directed graph using DFS.

• More Levels

• Beginner
• Advanced