Topic: graph-theory-problem / Level: intermediate

• 1751. Implement an algorithm to check if a bipartite graph can be colored with two colors using adjacency lists.
• 1752. Write a program to find the maximum flow in a directed graph using the Dinics algorithm with BFS.
• 1753. Implement an algorithm to calculate the number of simple cycles in a directed bipartite graph.
• 1754. Write a program to check if two directed graphs are equivalent using adjacency matrices.
• 1755. Implement an algorithm to find the longest path in a directed graph with negative edges using Bellman-Ford.
• 1756. Write a program to find the longest simple path in a bipartite graph using dynamic programming.
• 1757. Implement an algorithm to check if a graph is Eulerian using the adjacency list representation.
• 1758. Write a program to calculate the number of edges in a bipartite graph that form a cycle.
• 1759. Implement an algorithm to find the longest path that visits every edge in a bipartite graph.
• 1760. Write a program to check if a directed graph is a valid topological sort using the in-degree method.
• 1761. Implement an algorithm to calculate the minimum number of edges to add to a directed graph to make it strongly connected.
• 1762. Write a program to find the number of vertex-disjoint paths between two vertices in a bipartite graph.
• 1763. Implement an algorithm to find the shortest path from a source to multiple targets in a directed graph.
• 1764. Write a program to calculate the average degree of vertices in a bipartite graph.
• 1765. Implement an algorithm to check if a bipartite graph is 2-colorable.
• 1766. Write a program to find all maximal cliques in a bipartite graph using the Bron-Kerbosch algorithm.
• 1767. Implement an algorithm to find the longest simple cycle in a weighted graph using DFS.
• 1768. Write a program to calculate the distance between any two vertices in a directed acyclic graph.
• 1769. Implement an algorithm to check if a directed graph can be made strongly connected by removing edges.
• 1770. Write a program to find the shortest cycle in a bipartite graph using BFS.
• 1771. Implement an algorithm to find all simple paths in a directed graph using depth-first search.
• 1772. Write a program to find the longest path in a directed graph with both positive and negative weights.
• 1773. Implement an algorithm to find the number of strongly connected components in a directed graph using BFS.
• 1774. Write a program to check if two directed graphs are edge isomorphic using adjacency lists.
• 1775. Implement an algorithm to find the maximum flow in a directed graph using the Edmonds-Karp method.
• 1776. Write a program to find the longest simple path in a tree using a recursive approach.
• 1777. Implement an algorithm to check if a directed graph contains any cycles using Tarjans algorithm.
• 1778. Write a program to find the shortest path between two vertices in a directed graph using Dijkstras algorithm.
• 1779. Implement an algorithm to calculate the number of edges in a minimum spanning tree using Kruskal’s algorithm.
• 1780. Write a program to find all articulation points in a directed graph using DFS.
• 1781. Implement an algorithm to check if a graph is connected using BFS or DFS.
• 1782. Write a program to find the diameter of a graph using two BFS runs.
• 1783. Implement an algorithm to find the longest increasing subsequence in a directed graph using dynamic programming.
• 1784. Write a program to check if a bipartite graph can be partitioned into two equal parts.
• 1785. Implement an algorithm to calculate the number of spanning trees in a directed graph using Kirchhoffs theorem.
• 1786. Write a program to find all Hamiltonian paths in a weighted bipartite graph.
• 1787. Implement an algorithm to find the maximum flow in a bipartite graph using the Ford-Fulkerson method.
• 1788. Write a program to check if a graph contains any back edges using DFS.
• 1789. Implement an algorithm to find the longest path in a bipartite graph using dynamic programming.
• 1790. Write a program to calculate the average path length in a directed graph.
• 1791. Implement an algorithm to find the maximum independent set in a bipartite graph using the Hopcroft-Karp algorithm.
• 1792. Write a program to check if two bipartite graphs are isomorphic.
• 1793. Implement an algorithm to find the longest path that visits each vertex in a graph.
• 1794. Write a program to solve the "Vertex Cover Problem" in a directed acyclic graph.
• 1795. Implement an algorithm to check if a graph is a tree using DFS.
• 1796. Write a program to find the number of maximal independent sets in a directed graph.
• 1797. Implement an algorithm to calculate the transitive closure of a directed graph using Floyd-Warshall.
• 1798. Write a program to check if a directed graph can be 3-colored.
• 1799. Implement an algorithm to find the longest increasing subsequence in a bipartite graph.
• 1800. Write a program to check if a directed graph contains a unique path between any two vertices.

• More Levels

• Beginner
• Advanced