Python Program For Graph Deletion Operation | Delete Edge | Adjacency List | Data Structure

In this Python Programming video tutorial you will write a function to delete given edge in the given graph in detail.

Data structure is a way of storing and organising the data so that it can be accessed effectively.
Graph is a non linear data structure consisting of nodes and edges.

add_node function:

add_edge function:

delete_node function

#DataStructures #PythonPrograms #Graph

For more free tutorials on computer programming

[JohnWick-ieqp]

after your detailed explanation I did this program by myself without watching video
All Credit goes to You👍👌🖤

[lakshmivenkatavarun]

Mam you forgot deleting edge for weighted, directed graph....
Ans : (from else condition)
temp=[v2, cost]
if temp in graph[v1]:
graph[v1].remove(temp)

[arpitakar]

month long journey but thanks forfacilitaing my career great lovable explanation mechanical rocks

[hammadkhalid]

mam, in deletion of weighted, undirected edge u have taken a cost perimeter when there is not necessary for a person to know the cost of any specific edge....can u please tell a way in which we can delete an undirected, weighted node with knowing its

[jayavigneshs]

Really amazing explanation great content quality... 👌.. Voice is an additional magic.. Respect 💯

[pythonenthusiast]

Will you cover algorithms also as deeply you covered the data structures?
Please say yes !

[sanjog]

mam can I code this program for delete edge method in undirected weighted graph:

def delete_edge(v1, v2):
if v1 not in graph:
print(v1, "is not present in graph")
elif v2 not in graph:
print(v2, "is not present in graph")
else:
for i in graph[v1]:
if v2 is i[0]:
graph[v1].remove(i)
break
for j in graph[v2]:
if v1 is j[0]:
graph[v2].remove(j)
break