Author: ibmf

Question: Write an algorithm and a program in ‘C’ language to insert and delete edges in an adjacency list representation of an undirected graph. Make assumptions, if necessary.

Answer:

Assumptions

1. The graph is undirected.
2. Vertices are numbered from 0 to (V–1).
3. No multiple edges between the same pair of vertices.
4. Adjacency list is implemented using linked lists.
5. Maximum number of vertices is fixed.

Write an algorithm and program in ‘C’ language to merge two sorted linked lists. The resultant linked list should be sorted.