Topic: Graph-theory-question / Level: Advanced

• 490. Create a function to compute the minimum spanning forest of a disconnected graph.
• 491. Write a program to check if a tree is a valid binary search tree.
• 492. Implement an algorithm to solve the Chinese Postman Problem for directed graphs.
• 493. Write a program to compute the number of Hamiltonian paths in a graph.
• 494. Create a function to find the longest common path in two directed graphs.
• 495. Write a program to find the minimum cost flow in a flow network.
• 496. Implement a function to determine the longest common subsequence between multiple sequences.
• 497. Write a program to calculate the reachability from a single source in a directed graph.
• 498. Create a function to find the maximum flow in a bipartite graph.
• 499. Write a program to compute the Eulerian trail in an undirected graph.
• 500. Implement a function to find the shortest path in a directed graph with positive and negative weights.
• 501. Write a program to calculate the distance between all pairs of vertices using the Floyd-Warshall algorithm.
• 502. Create a function to determine if a directed graph can be made acyclic.
• 503. Write a program to find the longest palindrome path in a directed graph.
• 504. Implement an algorithm to compute the number of distinct cycles in a directed graph.
• 505. Write a program to find the longest simple path in a graph.
• 506. Create a function to compute the minimum number of edges needed to make a graph connected.
• 507. Write a program to find the longest path in a directed graph using dynamic programming.
• 508. Implement a function to check if a directed graph has a unique Eulerian circuit.
• 509. Write a program to find the minimum spanning tree of a graph using reverse delete algorithm.
• 510. Create a function to find the minimum cycle cover in a bipartite graph.
• 511. Write a program to check if a directed graph has a Hamiltonian cycle.
• 512. Implement an algorithm to compute the maximum weight independent set in a graph.
• 513. Write a program to find the shortest cycle in a directed graph.
• 514. Create a function to determine the minimum cut in a flow network using the Stoer-Wagner algorithm.
• 515. Write a program to find the longest chain of dependencies in a directed graph.
• 516. Implement a function to compute the betweenness centrality for a directed graph.
• 517. Write a program to determine the maximum distance from a vertex to all other vertices.
• 518. Create a function to find the shortest path in a directed graph with one negative weight edge.
• 519. Write a program to compute the minimum number of moves required to traverse a maze represented as a graph.

• More Levels

• Beginner
• Intermediate