Topic: graph-theory-problem / Level: beginner

• 951. Write a program to print all vertices with no outgoing edges in a weighted directed graph.
• 952. Implement a function to find all strongly connected components in a directed graph using adjacency matrices.
• 953. Write a program to find the shortest path between two vertices in a graph using adjacency lists and BFS.
• 954. Implement a function to calculate the total number of spanning subgraphs in a graph using BFS and adjacency lists.
• 955. Write a program to print the adjacency list of a directed graph sorted by in-degree.
• 956. Implement a function to check if a directed graph contains any Hamiltonian cycles using adjacency lists and BFS.
• 957. Write a program to find the longest simple cycle in a directed acyclic graph using DFS.
• 958. Implement a function to calculate the total number of edge-disjoint paths in a weighted directed graph using DFS.
• 959. Write a program to print all edges in a directed graph that are part of the longest Hamiltonian path.
• 960. Implement a function to calculate the chromatic number of a graph using BFS, DFS, and adjacency lists.
• 961. Write a program to check if a graph contains any Hamiltonian paths using adjacency lists.
• 962. Implement a function to calculate the number of strongly connected components in a graph using DFS and adjacency matrices.
• 963. Write a program to print all articulation points in a weighted graph using DFS and adjacency matrices.
• 964. Implement a function to find the number of simple paths between two vertices in a weighted directed graph.
• 965. Write a program to print the adjacency matrix of a weighted graph sorted by out-degree and in-degree.
• 966. Implement a function to calculate the number of simple cycles in a directed acyclic graph using BFS and DFS.
• 967. Write a program to check if a directed graph contains any Hamiltonian cycles using DFS and adjacency matrices.
• 968. Implement a function to calculate the number of spanning trees in a weighted graph using DFS and BFS.
• 969. Write a program to print all vertices that form the longest simple path in a directed graph using BFS.
• 970. Implement a function to check if a graph is strongly connected using adjacency matrices and BFS.
• 971. Write a program to calculate the total number of simple paths in a weighted directed graph using adjacency lists.
• 972. Implement a function to find all bridges in a directed graph using BFS and DFS.
• 973. Write a program to print all vertices with no incoming edges in a directed acyclic graph using BFS.
• 974. Implement a function to calculate the total number of spanning subgraphs in a weighted graph using adjacency matrices.
• 975. Write a program to find the shortest cycle in a weighted directed graph using BFS and DFS.
• 976. Implement a function to check if a directed graph contains any articulation points using DFS and adjacency lists.
• 977. Write a program to print all edges that form a Hamiltonian cycle in a weighted directed acyclic graph.
• 978. Implement a function to calculate the chromatic number of a directed acyclic graph using DFS, BFS, and adjacency matrices.
• 979. Write a program to find the longest simple path in a weighted graph using BFS and DFS.
• 980. Implement a function to check if a directed acyclic graph contains any Hamiltonian paths using BFS and DFS.
• 981. Write a program to calculate the total number of connected components in a directed graph using adjacency matrices.
• 982. Implement a function to print all vertices in a directed graph sorted by out-degree.
• 983. Write a program to find the number of simple paths between two vertices in a graph using BFS and DFS.
• 984. Implement a function to calculate the number of strongly connected components in a weighted graph using DFS and BFS.
• 985. Write a program to print all articulation points in a directed acyclic graph using adjacency lists.
• 986. Implement a function to check if a graph contains any Hamiltonian cycles using adjacency matrices and BFS.
• 987. Write a program to calculate the radius of a weighted directed graph using BFS and adjacency lists.
• 988. Implement a function to find the longest cycle in a weighted graph using DFS and BFS.
• 989. Write a program to print all edges in a directed acyclic graph that form a simple cycle.
• 990. Implement a function to calculate the chromatic number of a directed graph using DFS and adjacency matrices.
• 991. Write a program to check if a directed graph contains any Hamiltonian paths using BFS and adjacency lists.
• 992. Implement a function to calculate the total number of spanning trees in a graph using BFS, DFS, and adjacency matrices.
• 993. Write a program to print all vertices with degree zero in a directed acyclic graph.
• 994. Implement a function to find all strongly connected components in a weighted directed graph using BFS.
• 995. Write a program to print the adjacency matrix of a directed acyclic graph sorted by in-degree and out-degree.
• 996. Implement a function to check if two graphs are isomorphic using adjacency matrices and BFS.
• 997. Write a program to calculate the number of simple cycles in a directed graph using adjacency lists and DFS.
• 998. Implement a function to calculate the degree centrality of each vertex in a weighted directed graph using BFS and DFS.
• 999. Write a program to find the number of articulation points in a directed acyclic graph using BFS and DFS.
• 1000. Implement a function to calculate the total number of edge-disjoint paths between two vertices in a directed graph using DFS.

• More Levels

• Intermediate
• Advanced