More Problems

• Write a program to print the degree sequence of a graph.
• Implement a function to find the shortest path between two nodes using Dijkstra’s algorithm.
• Write a program to check if a graph contains any back edges.
• Implement a function to find all strongly connected components in a directed graph using DFS.
• Write a program to print all vertices that belong to cycles in a directed graph.
• Implement a function to calculate the chromatic number of a graph.
• Write a program to find the number of edge-disjoint paths between two nodes in a graph.
• Implement a function to check if an undirected graph has an Eulerian circuit.