More Problems

• Write a function to determine if a graph is a planar graph.
• Implement a program to count the number of isolated vertices in a graph.
• Write a function to check if a graph is strongly connected.
• Implement a program to find the minimum spanning tree using Boruvkas algorithm.
• Write a program to find the eccentricity of a vertex in a graph.
• Implement a function to check if a graph has a Hamiltonian cycle.
• Write a program to perform BFS traversal on a tree.
• Implement a function to find the longest path in an undirected graph.