Skip to Main Content
Data Structures Using C, 2nd Edition by Pearson
book

Data Structures Using C, 2nd Edition by Pearson

by A. K. Sharma
May 2024
Intermediate to advanced content levelIntermediate to advanced
521 pages
14h 12m
English
Pearson India
Content preview from Data Structures Using C, 2nd Edition by Pearson
396 Data Structures Using C
Note: Implementation of operations on graphs using adjacency matrix is simple as compared to adjacency
list. In fact, adjacency list would require the extra overhead of maintaining pointers. Moreover, the linked lists
connected to vertices are independent and it would be difficult to establish cross-relationship between the
vertices contained on different lists, which is otherwise possible by following a column in adjacency matrix.
8.4.4 Spanning Trees
A connected undirected graph has the following two properties:
n ere exists a path from every node to every other node.
n e edges have no associated directions.
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Data Structures Using C

Data Structures Using C

Samir Kumar Bandyopadhyay, Kashi Nath Dey
Intermediate C Programming, 2nd Edition

Intermediate C Programming, 2nd Edition

Yung-Hsiang Lu, George K. Thiruvathukal

Publisher Resources

ISBN: 9781299831582