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
368 Data Structures Using C
Fig. 8.4 Multigraphs
(a)
A
C
D
E
B
(b)
A
C
D
E
B
Adjacent node: A node Y is called adjacent to X if there exists an edge from X to Y. Y is called successor
of X and X predecessor of Y. The set of nodes adjacent to X are called neighbours of X.
Complete graph: A complete graph is a graph G = <V, E> with the property that each node of the graph
is adjacent to all other nodes of the graph, as shown in Figure 8.3(b).
Acyclic graph: A graph without a cycle is called an acyclic graph as shown in Figure 8.3(c). In fact, a tree
is an excellent example of an acyclic graph.
Self loop: If the starting and ending nodes
of an edge are same, ...
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