More Problems

• Write a program to print all vertices with no incoming edges in a directed acyclic graph.
• Implement a function to check if a graph contains any articulation points using DFS
• Write a program to print all vertices with no outgoing edges in a weighted directed graph.
• Implement a function to find all simple cycles in a directed graph using adjacency lists.
• Write a program to check if a directed graph contains any back edges using BFS.
• Implement a function to calculate the total number of spanning trees in a weighted undirected graph.
• Write a program to print all edges in a graph that belong to the shortest path between two nodes.
• Implement a function to check if two directed graphs are isomorphic using BFS.