Topic: Graph-theory-question / Level: Advanced

• 520. Implement an algorithm to find the optimal solution to the Max-Cut Problem.
• 521. Write a program to calculate the average distance between all pairs of vertices in a graph.
• 522. Create a function to compute the strongly connected components of a directed graph using Tarjan's algorithm.
• 523. Write a program to find the largest path sum in a binary tree.
• 524. Implement a function to find the longest increasing subsequence in a sequence of numbers.
• 525. Write a program to check if a directed graph has a unique shortest path between two vertices.
• 526. Create a function to compute the flow network's minimum cut.
• 527. Write a program to determine the maximum flow in a flow network using the Capacity Scaling algorithm.
• 528. Implement an algorithm to find the longest path in a directed graph with negative weights.
• 529. Write a program to compute the expected distance between two vertices in a random graph.
• 530. Create a function to check if a directed graph has a unique longest path.
• 531. Write a program to find the shortest path between two vertices in an undirected graph using Dijkstra's algorithm.
• 532. Implement a function to compute the network flow's maximum capacity.
• 533. Write a program to find the longest path in a tree.
• 534. Create a function to determine if a graph can be partitioned into two subsets.
• 535. Write a program to compute the distance matrix for a graph.
• 536. Implement an algorithm to find the maximum independent set in a graph.
• 537. Write a program to check if a directed graph can be made strongly connected.
• 538. Create a function to compute the number of spanning trees in a directed graph.
• 539. Write a program to find the longest increasing path in a matrix represented as a graph.
• 540. Implement a function to compute the average clustering coefficient for a graph.
• 541. Write a program to determine the number of edges needed to connect all components in a graph.
• 542. Create a function to find the longest simple cycle in a graph.
• 543. Write a program to compute the minimum distance between any two vertices in a graph.
• 544. Implement an algorithm to find the longest path in a weighted graph.
• 545. Write a program to check if a directed graph is a Directed Acyclic Graph (DAG).
• 546. Create a function to compute the number of edges in a bipartite graph.
• 547. Write a program to determine the longest path that visits every vertex in a graph.
• 548. Implement a function to compute the maximum flow using the Capacity Scaling algorithm.
• 549. Write a program to find the shortest path in an undirected graph using Dijkstra's algorithm.

• More Levels

• Beginner
• Intermediate