Topic: graph-theory-problem / Level: beginner

• 901. Write a program to print the adjacency list of a graph sorted by degree in decreasing order.
• 902. Implement a function to check if a directed acyclic graph contains any Hamiltonian cycles using BFS.
• 903. Write a program to calculate the total number of spanning trees in a weighted graph using BFS.
• 904. Implement a function to find the longest path in a weighted directed acyclic graph using DFS.
• 905. Write a program to print all edges in a graph that form a cycle using BFS.
• 906. Implement a function to check if a graph contains any cut vertices using BFS and DFS.
• 907. Write a program to calculate the degree centrality of each vertex in a directed graph using BFS.
• 908. Implement a function to find the number of simple paths between two vertices in a graph using DFS.
• 909. Write a program to print the adjacency matrix of a weighted directed graph sorted by degree.
• 910. Implement a function to check if two graphs are strongly isomorphic using adjacency matrices.
• 911. Write a program to print all vertices with no incoming edges in a weighted directed graph.
• 912. Implement a function to calculate the total number of spanning trees in a graph using Kirchhoffs theorem.
• 913. Write a program to check if a graph contains any Hamiltonian paths using BFS and DFS.
• 914. Implement a function to find all strongly connected components in a directed graph using adjacency lists.
• 915. Write a program to calculate the chromatic number of a weighted directed graph using BFS and DFS.
• 916. Implement a function to check if a directed graph contains any back edges using BFS.
• 917. Write a program to print all vertices that form a simple cycle in a weighted directed graph.
• 918. Implement a function to calculate the number of edge-disjoint paths in a weighted directed graph.
• 919. Write a program to find the shortest path between two vertices in a weighted graph using adjacency matrices.
• 920. Implement a function to print all articulation points in a weighted directed graph using BFS.
• 921. Write a program to find the longest simple path between two vertices in a directed graph using DFS.
• 922. Implement a function to calculate the number of spanning subgraphs in a weighted graph using BFS.
• 923. Write a program to print all edges that form a Hamiltonian cycle in a directed graph.
• 924. Implement a function to check if a directed acyclic graph contains any articulation points using adjacency lists.
• 925. Write a program to calculate the total number of simple cycles in a directed graph using DFS and BFS.
• 926. Implement a function to calculate the chromatic number of a weighted directed acyclic graph using BFS.
• 927. Write a program to find the number of strongly connected components in a directed graph using adjacency lists.
• 928. Implement a function to calculate the number of spanning subgraphs in a graph using DFS and BFS.
• 929. Write a program to print all vertices with degree greater than or equal to 2 in a directed acyclic graph.
• 930. Implement a function to check if a graph is strongly connected using BFS and adjacency matrices.
• 931. Write a program to calculate the total number of connected components in a directed acyclic graph.
• 932. Implement a function to print all vertices that form the longest simple path in a graph using adjacency matrices.
• 933. Write a program to find the shortest cycle in a weighted graph using DFS.
• 934. Implement a function to check if a directed acyclic graph contains any Hamiltonian paths using adjacency matrices.
• 935. Write a program to print all vertices that form a Hamiltonian cycle in a directed acyclic graph.
• 936. Implement a function to calculate the total number of edge-disjoint cycles in a graph using BFS.
• 937. Write a program to calculate the number of strongly connected components in a weighted directed graph.
• 938. Implement a function to find the number of articulation points in a graph using BFS and DFS.
• 939. Write a program to print all vertices that form a Hamiltonian path in a weighted directed graph.
• 940. Implement a function to calculate the total number of simple paths between two vertices in a directed acyclic graph using DFS.
• 941. Write a program to find the number of simple cycles of length 3 in a weighted graph using BFS.
• 942. Implement a function to check if a graph contains any Hamiltonian cycles using adjacency matrices.
• 943. Write a program to calculate the chromatic number of a directed graph using adjacency lists and BFS.
• 944. Implement a function to calculate the number of spanning trees in a directed graph using DFS.
• 945. Write a program to print all articulation points in a graph using BFS and adjacency lists.
• 946. Implement a function to check if a directed graph contains any Hamiltonian paths using adjacency lists.
• 947. Write a program to calculate the total number of simple cycles in a weighted directed graph using DFS.
• 948. Implement a function to find the longest path in a weighted graph using BFS and DFS.
• 949. Write a program to print the adjacency matrix of a graph sorted by in-degree and out-degree.
• 950. Implement a function to check if a graph contains any articulation points using DFS and adjacency lists.

• More Levels

• Intermediate
• Advanced