Basic Graph Programs in C for Freshers

# Program Name Description Resources
1 Adjacency Matrix Implement graph using adjacency matrix GeeksforGeeks
2 Adjacency List Implement graph using adjacency list GeeksforGeeks
3 Edge List Implement graph using edge list GeeksforGeeks
4 Weighted Graph Implement weighted graph GeeksforGeeks
5 Directed Graph Implement directed graph GeeksforGeeks
6 BFS Traversal Breadth First Search traversal GeeksforGeeks
7 DFS Traversal Depth First Search traversal GeeksforGeeks
8 Iterative DFS DFS using stack (iterative) GeeksforGeeks
9 Level Order Traversal Level by level traversal GeeksforGeeks
10 Topological Sort Topological sorting of DAG GeeksforGeeks
11 Connected Components Find connected components GeeksforGeeks
12 Cycle Detection Detect cycle in graph GeeksforGeeks
13 Shortest Path (Unweighted) Shortest path in unweighted graph GeeksforGeeks
14 Dijkstra's Algorithm Shortest path in weighted graph GeeksforGeeks
15 Bellman-Ford Algorithm Shortest path with negative weights GeeksforGeeks
16 Prim's Algorithm Minimum Spanning Tree GeeksforGeeks
17 Kruskal's Algorithm Minimum Spanning Tree GeeksforGeeks
18 Union-Find Data Structure Disjoint Set Union (DSU) GeeksforGeeks
19 Boruvka's Algorithm Minimum Spanning Tree GeeksforGeeks
20 Reverse Delete Algorithm Minimum Spanning Tree GeeksforGeeks
21 Floyd-Warshall Algorithm All pairs shortest paths GeeksforGeeks
22 Johnson's Algorithm All pairs shortest paths GeeksforGeeks
23 Articulation Points Find articulation points GeeksforGeeks
24 Bridges in Graph Find bridges GeeksforGeeks
25 Strongly Connected Components Kosaraju's algorithm GeeksforGeeks
26 Bipartite Graph Check Check if graph is bipartite GeeksforGeeks
27 Eulerian Path/Circuit Find Eulerian path/circuit GeeksforGeeks
28 Hamiltonian Path/Cycle Find Hamiltonian path/cycle GeeksforGeeks
29 Graph Coloring Graph coloring problem GeeksforGeeks
30 Maximum Flow (Ford-Fulkerson) Maximum flow in network GeeksforGeeks
31 Minimum Cut Find minimum cut in graph GeeksforGeeks
32 Traveling Salesman Problem TSP using dynamic programming GeeksforGeeks
33 Chinese Postman Problem Route inspection problem GeeksforGeeks
34 Clustering Coefficient Calculate clustering coefficient GeeksforGeeks
35 PageRank Algorithm Basic PageRank implementation GeeksforGeeks
36 Tree Properties Check if graph is a tree GeeksforGeeks
37 Complete Graph Check if graph is complete GeeksforGeeks
38 Regular Graph Check if graph is regular GeeksforGeeks
39 Planar Graph Number of region in Planar Graph GeeksforGeeks
40 Biconnected Graph Check if graph is biconnected GeeksforGeeks
Related Graph Resources
Interview Questions
MCQs
Problem Solving Tricks
Tech Hub