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
Graphs 379
8.4.2 Deletion Operation
The deletion of a vertex and its associated edges from an adjacency matrix, for directed and undirected
graph, involves the following operations:
(1) Deleting the row corresponding to the vertex.
(2) Deleting the col corresponding to the vertex.
The algorithm is straight forward and given below:
Algorithm delVertex (verTex)
{
find the row corresponding to verTex and set all its elements = ‘0’;
find the col corresponding to verTex and set all its elements = ‘0’;
}
The deletion of an edge from a graph requires different treatment for undirected and directed
graphs. Both the cases of deletion of edges ...
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