O(n). time when All elemets related to one edge.

The Gateway to Computer Science Excellence

0 votes

0

In case of adjacency list we have to travel the linked list so it takes O(n) and in case of adjacency matrix it it takes O(1) becoz we just have to put 0 in the cell of corresponding matrix

0

I think to remove an edge will take O(n) nd adding an edge will take constant time.

where n is no of edges in graph originally.

where n is no of edges in graph originally.

0

we can insert new node at start node or last node.

if we insert at first node only one pointer variable is changed so time complexity is** o(1)**,but at last we can traverse the linked list so time complexity is **o(n)**.

in case of deletion we exactly dont know where the required node present so time complexity is** o(n)**

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,292 answers

198,236 comments

104,919 users