Topic: graph-theory-problem / Level: beginner

• 851. Write a program to print all vertices that form the shortest Hamiltonian path in a weighted graph.
• 852. Implement a function to calculate the number of spanning subgraphs in a weighted directed graph using DFS.
• 853. Write a program to find the number of cycles in a weighted directed graph using BFS.
• 854. Implement a function to check if a graph is strongly connected using adjacency matrices and DFS.
• 855. Write a program to print the adjacency matrix of a directed graph sorted by out-degree and in-degree.
• 856. Implement a function to calculate the total number of simple cycles in a weighted graph using DFS.
• 857. Write a program to print all vertices in a weighted graph sorted by out-degree.
• 858. Implement a function to check if a graph contains any articulation points using DFS and BFS.
• 859. Write a program to find all articulation points in a weighted directed acyclic graph using adjacency matrices.
• 860. Implement a function to calculate the number of strongly connected components in a weighted directed graph using BFS.
• 861. Write a program to find all strongly connected components in a weighted directed graph using adjacency lists.
• 862. Implement a function to print all edges in a graph that form a simple path between two vertices.
• 863. Write a program to find the number of spanning subgraphs in a graph using BFS and DFS.
• 864. Implement a function to check if two directed graphs are strongly isomorphic using adjacency lists.
• 865. Write a program to print all vertices in a directed acyclic graph sorted by in-degree and out-degree.
• 866. Implement a function to find the number of simple cycles in a weighted graph using BFS and DFS.
• 867. Write a program to calculate the total number of spanning trees in a directed graph using Kirchhoffs theorem.
• 868. Implement a function to check if a directed graph contains any Hamiltonian paths using adjacency matrices.
• 869. Write a program to print all vertices that form a Hamiltonian cycle in a weighted directed graph.
• 870. Implement a function to calculate the number of edge-disjoint paths in a directed acyclic graph.
• 871. Write a program to find the longest path between two vertices in a weighted directed graph using DFS.
• 872. Implement a function to calculate the chromatic number of a directed graph using adjacency matrices.
• 873. Write a program to print all articulation points in a weighted graph using BFS and DFS.
• 874. Implement a function to check if a graph contains any back edges using adjacency lists.
• 875. Write a program to calculate the number of simple cycles in a directed acyclic graph using DFS.
• 876. Implement a function to print the degree of each vertex in a directed graph using adjacency lists.
• 877. Write a program to find the shortest path in a weighted directed acyclic graph using BFS.
• 878. Implement a function to calculate the number of spanning subgraphs in a directed acyclic graph using BFS.
• 879. Write a program to print all vertices that form the longest simple cycle in a directed acyclic graph.
• 880. Implement a function to check if a graph contains any cut vertices using adjacency matrices.
• 881. Write a program to find the number of simple paths in a directed graph using DFS.
• 882. Implement a function to calculate the degree centrality of each vertex in a graph using adjacency lists.
• 883. Write a program to print all strongly connected components in a directed graph using BFS and DFS.
• 884. Implement a function to calculate the chromatic number of a graph using DFS and BFS.
• 885. Write a program to find the longest cycle in a weighted directed graph using BFS.
• 886. Implement a function to check if a directed graph contains any Hamiltonian cycles using DFS and BFS.
• 887. Write a program to print the adjacency matrix of a graph sorted by in-degree.
• 888. Implement a function to find the number of articulation points in a graph using adjacency matrices.
• 889. Write a program to calculate the radius of a directed graph using DFS and BFS.
• 890. Implement a function to calculate the number of spanning trees in a weighted directed graph using DFS.
• 891. Write a program to print all vertices with no outgoing edges in a weighted graph.
• 892. Implement a function to check if a graph is strongly connected using BFS and DFS.
• 893. Write a program to find the shortest cycle in a directed graph using adjacency lists.
• 894. Implement a function to calculate the total number of simple paths between two vertices in a directed graph using DFS.
• 895. Write a program to print all vertices that form the longest Hamiltonian cycle in a graph.
• 896. Implement a function to check if two directed graphs are isomorphic using adjacency lists.
• 897. Write a program to calculate the number of connected components in a weighted graph using BFS and DFS.
• 898. Implement a function to find all strongly connected components in a weighted graph using adjacency matrices.
• 899. Write a program to print all articulation points in a graph using adjacency lists and DFS.
• 900. Implement a function to calculate the number of simple cycles in a weighted directed graph using BFS.

• More Levels

• Intermediate
• Advanced