More Problems

• Write a program to find the shortest Hamiltonian path in a directed graph.
• Implement a function to calculate the total number of strongly connected components in a directed graph.
• Write a program to print all edges that form the longest simple path in a graph.
• Implement a function to check if a graph is bipartite using adjacency matrices.
• Write a program to print all vertices in a directed graph with an even degree.
• Implement a function to calculate the eccentricity of each vertex in a directed graph.
• Write a program to check if two vertices in a directed graph are strongly connected.
• Implement a function to find all cycles in a directed graph using DFS.