In this unit, we will describe a data structure called Graph. Actually, graph is a general tree along no parent-child relationship. In computer science, Graphs have several applications and other fields of science. Generally, graphs represent a comparatively less restrictive relationship among the data items. We will discuss about both undirected graphs & directed graphs. The unit also comprises information on different algorithms which are depending on graphs.
After learning this unit, you have to be able to
- know regarding graphs and associated terminologies;
- know regarding directed and undirected graphs along their representations;
- know different shortest path algorithms;
- construct minimum cost spanning trees;
- apply depth first search & breadth first search algorithms, and
- Determining strongly connected components of a graph.