Nonlinear Data Structures: Graph
Amol M Jagtap, Ajit S Mali · 2021
This chapter focuses on data structures where data elements are not arranged sequentially or linearly are called nonlinear data structures. It covers graph representation using an adjacency matrix and adjacency list. It covers graph-traversing techniques such as breadth first search (BFS) and depth first search (DFS). In addition, the graph solves the shortest path algorithm and minimum spanning tree.