More Problems

• Write a program to calculate the average degree of vertices in a directed graph.
• Implement an algorithm to find all simple paths from a source to a target in a directed graph.
• Write a program to find the shortest path between two vertices in a bipartite graph using BFS.
• Implement an algorithm to check if two directed graphs are strongly isomorphic using adjacency matrices.
• Write a program to find all maximal cliques in a directed graph using dynamic programming.
• Implement an algorithm to check if a directed graph is a tree using properties of trees.
• Write a program to find the longest increasing path in a weighted directed graph.
• Implement an algorithm to find the number of edges in a minimum spanning tree using Prims algorithm.