More Problems

• Implement a function to check if two directed graphs are isomorphic using adjacency matrices.
• Write a program to print all edges of a graph with weights below a given threshold.
• Implement a function to find the number of connected subgraphs in a weighted graph.
• Write a program to find the number of nodes in the shortest path in a directed graph.
• Implement a function to calculate the eccentricity of each vertex in a weighted graph.
• Write a program to print all nodes with degree greater than 3 in a graph.
• Implement a function to check if a directed graph contains any simple paths.
• Write a program to find the number of cycles in a graph using DFS.