More Problems

• Implement a program to check if an edge exists between two nodes in a graph.
• Write a function to find all adjacent vertices of a given vertex.
• Implement a function to find the shortest path between two nodes in a graph using DFS.
• Write a function to find all leaf nodes in a graph.
• Write a function to calculate the total number of edges in a graph.
• Write a program to create a graph from user input.
• Implement a program to count the number of self-loops in a graph.
• Write a function to find the number of paths between two vertices using BFS.