More Problems

• Implement a function to check if a directed graph is Hamiltonian.
• Write a program to print the adjacency matrix of a directed acyclic graph.
• Implement a function to find the longest simple path in an undirected graph.
• Write a program to check if a graph contains any self-loops.
• Implement a function to print all strongly connected components in a directed graph using Kosarajus algorithm.
• Write a program to find the number of nodes with no incoming edges in a directed acyclic graph.
• Implement a function to find the number of vertices in the largest simple cycle in a graph.
• Write a program to calculate the number of spanning trees in a graph using Kirchhoffs theorem.