More Problems

• Implement a program to check for self-loops in a directed graph.
• Write a function to find all cycles in a directed graph.
• 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