Abstract
Graph theory , which has emerged as an independent field, encompasses studies on trees as well. Graph theory has turned out to be a vast area with innumerable applications. This chapter introduces graphs as effective data structures and deals with the concepts and terminologies needed to promote this aspect of graphs and specific applications, which are relevant to computer science. The representation of graphs in a computer can be categorized as sequential representation and linked representation. Of the two, though sequential representation has several methods, all of them follow a matrix representation thereby calling for their implementation using arrays. The linked representation of a graph makes use of a singly linked list as its fundamental data structure. Finally, the chapter illustrates the application of graphs for determination of shortest path (single source shortest path problem); and extraction of minimum cost spanning trees.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
