Graph theory can be daunting, but "Data Structures Through C in Depth" demystifies it. It covers the Representation of Graphs (Adjacency Matrix vs. Adjacency List) and the classic traversal algorithms: BFS (Breadth-First Search) and DFS (Depth-First Search). Furthermore, it tackles Minimum Spanning Trees (Prim’s and Kruskal’s algorithms) and Shortest Path algorithms (Dijkstra’s).
The book is structured for semester-long university courses (especially for Indian universities like UPTU, VTU, and Delhi University). Each chapter includes: data structures through c in depth s.k. srivastava pdf