[7.2] Graph Adjacency List in Python | Data Structures in Python

An adjacency list represents a graph as an array of linked lists.
The index of the array represents a vertex and each element in its linked list represents the other vertices that form an edge with the vertex.
We will implement adjacency list in Python.

🔗Important Links:

🌐Join our community:
#python #graphtheory #list #adjacencylist
Keywords:
adjacency list
adjacency list in python
adjacency list vs adjacency matrix
graph theory
adjacency list graph representation
data structures and algorithms
master ds algo

[alexanderthelost]

oh man !! This is what i am looking for.Thanks man

[sachinmaurya]

Nice video!!
Are you using Vim editor?

[jyoti.m]

Just one confusion, in the while condition we should use [while tmp is not None:] instead of while tmp

[hymap]

We have initialized graph with 5 vertices but how could for loop(for i in range(self.nV)) will loop through 4 times ?

[siriuseneegy]

Hi bro ! I'm willing to do a project on resume building app ...and if you have experience or knowledge regrading this project ...i would genuinely like to get your guidance!

[BlueSky-kprk]

Broo Can't we add vertices like A B C instead of integery