More Problems

• Write a program to calculate the number of spanning trees in a graph using Kirchhoffs theorem.
• Implement a function to print all vertices with no outgoing edges in a directed graph.
• Write a program to check if a directed graph contains any back edges.
• Implement a function to calculate the eccentricity of each vertex in a graph.
• Write a program to print all leaf nodes in a directed acyclic graph.
• Implement a function to find all edge-disjoint cycles in an undirected graph.
• Write a program to check if a graph contains any parallel edges using an adjacency matrix.
• Implement a function to print all simple paths in a directed acyclic graph.