More Problems

• Check if a directed graph is acyclic.
• Write a program to find the maximum flow in a flow network using BFS.
• Implement a program to find the longest common path in a tree.
• Write a function to perform a depth-first traversal of a tree.
• Implement a program to find the minimum spanning tree using Prims algorithm.
• Write a program to print the adjacency matrix of a graph
• Write a program to add an edge to a graph.
• Write a program to remove an edge from a graph.