Topic: graph-theory-problem / Level: beginner

• 801. Write a program to print all edges that form a Hamiltonian cycle in a weighted graph.
• 802. Implement a function to check if a graph contains any cut vertices using adjacency matrices.
• 803. Write a program to calculate the radius of a graph using BFS and DFS.
• 804. Implement a function to print all articulation points in a weighted graph using BFS.
• 805. Write a program to find the number of strongly connected components in a directed graph using BFS.
• 806. Implement a function to calculate the total number of edge-disjoint cycles in a weighted directed graph.
• 807. Write a program to print all vertices with no outgoing edges in a weighted directed graph.
• 808. Implement a function to check if a directed acyclic graph contains any Hamiltonian paths using BFS.
• 809. Write a program to find the shortest path between two vertices in a graph using adjacency matrices.
• 810. Implement a function to calculate the chromatic number of a weighted directed acyclic graph using DFS.
• 811. Write a program to print all vertices that form the shortest Hamiltonian cycle in a graph.
• 812. Implement a function to calculate the degree centrality of each vertex in a directed acyclic graph.
• 813. Write a program to print all articulation points in a graph using adjacency lists.
• 814. Implement a function to find the number of simple cycles in a graph using BFS and DFS.
• 815. Write a program to calculate the total number of spanning trees in a graph using Kirchhoffs matrix tree theorem.
• 816. Implement a function to check if a graph contains any Hamiltonian paths using BFS and DFS.
• 817. Write a program to print all vertices that form the longest simple cycle in a weighted graph.
• 818. Implement a function to calculate the number of connected components in a directed acyclic graph.
• 819. Write a program to print the adjacency matrix of a graph sorted by out-degree.
• 820. Implement a function to check if a graph contains any back edges using BFS and DFS.
• 821. Write a program to find the longest path in a directed graph using adjacency lists.
• 822. Implement a function to calculate the total number of connected components in a weighted directed acyclic graph.
• 823. Write a program to print all vertices that form the longest Hamiltonian path in a directed graph.
• 824. Implement a function to check if a graph contains any articulation points using BFS and DFS.
• 825. Write a program to find all the strongly connected components in a directed graph using adjacency matrices.
• 826. Implement a function to calculate the total number of edge-disjoint cycles in a graph using BFS.
• 827. Write a program to print all vertices in a graph sorted by degree.
• 828. Implement a function to find the number of simple cycles in a weighted directed graph using adjacency matrices.
• 829. Write a program to check if two graphs are strongly isomorphic using adjacency matrices.
• 830. Implement a function to calculate the chromatic number of a weighted directed graph using BFS.
• 831. Write a program to find the shortest cycle in a weighted directed acyclic graph using DFS.
• 832. Implement a function to check if a graph contains any Hamiltonian cycles using DFS and BFS.
• 833. Write a program to print all vertices that form a simple cycle in a directed graph using adjacency matrices.
• 834. Implement a function to calculate the number of spanning subgraphs in a weighted graph using BFS.
• 835. Write a program to print the adjacency list of a directed graph sorted by out-degree.
• 836. Implement a function to check if a directed acyclic graph contains any articulation points using adjacency lists.
• 837. Write a program to find all bridges in a directed graph using DFS and BFS.
• 838. Implement a function to calculate the number of strongly connected components in a weighted directed graph using DFS.
• 839. Write a program to print all edges that form the longest simple cycle in a weighted graph.
• 840. Implement a function to check if a graph contains any parallel edges using adjacency lists.
• 841. Write a program to find the number of simple paths between two vertices in a weighted directed graph using BFS.
• 842. Implement a function to calculate the total number of spanning subgraphs in a graph using adjacency lists.
• 843. Write a program to print the adjacency matrix of a weighted graph sorted by degree.
• 844. Implement a function to check if a graph contains any articulation points using adjacency lists and DFS.
• 845. Write a program to calculate the total number of simple paths between two nodes in a graph using DFS.
• 846. Implement a function to print all vertices with no incoming edges in a weighted directed graph.
• 847. Write a program to find the shortest path between two vertices in a directed graph using adjacency lists.
• 848. Implement a function to calculate the number of strongly connected components in a graph using BFS and DFS.
• 849. Write a program to check if a directed graph contains any Hamiltonian paths using adjacency lists.
• 850. Implement a function to calculate the chromatic number of a directed acyclic graph using BFS and DFS.

• More Levels

• Intermediate
• Advanced