Topic: graph-theory-problem / Level: beginner

• 51. Write a program to add an edge to a graph.
• 52. Write a program to remove an edge from a graph.
• 53. Implement a program to check if an edge exists between two nodes in a graph.
• 54. Write a function to find all adjacent vertices of a given vertex.
• 55. Implement a function to find the shortest path between two nodes in a graph using DFS.
• 56. Write a function to find all leaf nodes in a graph.
• 57. Write a function to calculate the total number of edges in a graph.
• 58. Write a program to create a graph from user input.
• 59. Implement a program to count the number of self-loops in a graph.
• 60. Write a function to find the number of paths between two vertices using BFS.
• 61. Implement a function to remove a vertex from a graph.
• 62. Write a program to check if a graph is complete.
• 63. Implement a function to find the degree of a node in a graph.
• 64. Write a program to perform DFS traversal starting from a given vertex.
• 65. Implement a function to print the adjacency list representation of a graph.
• 66. Write a function to convert a directed graph to an undirected graph.
• 67. Implement a program to find the longest path between two nodes in a tree.
• 68. Write a function to find the total number of vertices in a graph.
• 69. Implement a function to find all vertices with no incoming edges in a directed graph.
• 70. Write a program to add a vertex to a graph.
• 71. Implement a function to find all isolated vertices in a graph.
• 72. Write a function to check if a graph contains a simple path.
• 73. Implement a program to find all the bridges in an undirected graph.
• 74. Write a function to determine if a graph is a planar graph.
• 75. Implement a program to count the number of isolated vertices in a graph.
• 76. Write a function to check if a graph is strongly connected.
• 77. Implement a program to find the minimum spanning tree using Boruvkas algorithm.
• 78. Write a program to find the eccentricity of a vertex in a graph.
• 79. Implement a function to check if a graph has a Hamiltonian cycle.
• 80. Write a program to perform BFS traversal on a tree.
• 81. Implement a function to find the longest path in an undirected graph.
• 82. Write a program to check if two vertices are adjacent in a graph.
• 83. Implement a function to find the center of a graph.
• 84. Write a function to find the largest connected component in a graph.
• 85. Implement a program to check if a graph has any parallel edges.
• 86. Write a function to detect if a graph is disconnected.
• 87. Implement a function to find the radius of a graph.
• 88. Write a program to calculate the average distance between vertices in a graph.
• 89. Implement a function to find the shortest path between two nodes using the adjacency matrix.
• 90. Write a function to check if a graph contains a Eulerian circuit.
• 91. Implement a program to print all articulation points in a graph.
• 92. Write a function to perform a breadth-first traversal of a directed graph.
• 93. Implement a program to perform BFS traversal from a specified node.
• 94. Write a function to find the in-degree of a vertex in a directed graph.
• 95. Implement a function to perform DFS traversal on a graph with cycles.
• 96. Write a function to detect all cycles in an undirected graph.
• 97. Implement a program to find all simple paths between two nodes in a graph.
• 98. Write a function to check if a graph contains isolated vertices.
• 99. Implement a program to check if a given graph is a bipartite graph using DFS.
• 100. Write a function to calculate the density of a graph.

• More Levels

• Intermediate
• Advanced