python language

graph

when implementing a graph with an adjacency list, where the list is implemented with a doubly linked list, what is the big O (O()) complexity of the following operations. Explain your answer, and specify all your assumptions.

1. DeleteVertex()

2. DeleteEdge()

3. GetEdge(u,v): returns the edge connecting node u to node v, if one exists

"Get 15% discount on your first 3 orders with us"
Use the following coupon
"FIRST15"

Order Now