Adjacency List Implementation in Python | Graph Data Structure

[@PyTechVision]

watch the video at 1.25x speed

[@salikmalik7631]

I really shock why you don't have 100k subscriber awesome explanation.. plz don't stop

[@mohdmohsin5740]

Bhai maza aa gya yaar sahi me keep it up

[@PyTechVision]

Thanks bhai

[@swarakasera9992]

Thanks for this easy explanation 😊

[@nkunam]

Best video man. Absolutely loved the way you explained.

[@teluguengineering5768]

This is awesome. You deserve million subs.

[@PyTechVision]

Maybe one day!

[@dividimri9249]

best video on graph so far . superb bru

[@PyTechVision]

Thank you so much

[@VishalKUMAR-zs1lc]

Gr8 explaination

[@PyTechVision]

Thanks Vishal

[@__goyal__]

Thank you Shahrukh for such a lucid explanation!

[@PyTechVision]

Thanks Shubham

[@princepanwar3078]

Best video explanation of all time really love it bro

[@PyTechVision]

Thank you so much 😀

[@vivekpisal2857]

Good explanation 👍👍👍

[@PyTechVision]

Thanks for liking

[@vallala07vinay11]

This is a good explanation video .Just watch it with 1.5 playback speed.
@Shahrukh Khan Thankyou for making this video .

[@PyTechVision]

Thanks for watching

[@sanskritibansal-t1x]

Trust me, This is the best implementation of graph available till date 07-10-23.
Thanks a lott mann

[@charankumarr3506]

best video on graph implementation....thanks a lot bro

[@PyTechVision]

Glad you liked it

[@kundrapumanju8376]

nice bro, A very good explanation.

[@PyTechVision]

Thanks

[@mayurikishore9599]

This is the best explanation I have seen so far. Thank you so much for sharing.

[@PyTechVision]

You're very welcome!

[@tejasadanala7034]

Super bro great explanation 💯👌

[@PyTechVision]

Thank you so much 🙂

[@yogeshgupta6094]

Can U make a video on adj matrix implementation

[@PyTechVision]

Sure I will, subscribe to get the update, and thanks for watching.

[@manideep7969]

The best explanation of Adjacency list representation.

[@uttarakhandwala8745]

Super content

[@rakshitks7850]

This is amazing explanation

[@PyTechVision]

Thanks Rakshit

[@lonnybulldozer8426]

This was pretty good.

[@PyTechVision]

Thanks, keep watching

[@endrendrumedits3235]

Clean explanation...pls do more videos on graphs and trees

[@PyTechVision]

Sure I will

[@jaysuryaray3296]

I was looking for graph implimentations for sooo long i m soo happy thanks alot

[@PyTechVision]

Glad to hear that

[@vidhikumar1664]

nicee!

[@ddremer6909]

Thank You So Much Brother. 😇

[@JobScholarshipAlerts]

Thanks a lot

[@PyTechVision]

Most welcome

[@anujpatel1654]

That was a pretty good explanation

[@PyTechVision]

Glad you think so!

[@ddremer6909]

What software are you using?

[@missionai1009]

well done man

[@PyTechVision]

Thanks bhupinder

[@drcelestia]

Thanks!!! Much Appreciated.

[@PyTechVision]

You're welcome @Apurv Taneja

[@MrDaniel560]

major thanks! the best ever

[@PyTechVision]

Thanks Danny

[@rabindrabehera5623]

Very nicely described.Hope you will add more videos on data structures and algorithms using python.

[@PyTechVision]

Thanks Rabindra Behera, Will upload soon more videos

[@sahildigikar9115]

Really thank you ...please upload more graph videos in python

[@PyTechVision]

Glad it was helpful. I will upload more videos in python.

[@dewman7477]

@@PyTechVision Hey I have a question. How do I implement an algorithm to reduce the graph from weighted to an unweighted graph? Let’s say I’m given a set of edge weights like {1, 2} in a weighted undirected graph. How do I transform a graph so that all edge weights in a graph are equal (where preferably each edge weight in new graph equals to 1)? I know I may have to add or remove edges and intermediate vertices but is there a way to think about this?

[@chandans8141]

Subscribed :)
Great Video..Thank You

[@PyTechVision]

Thanks for the sub!

[@nilufaislam4768]

A very good explanation. Thank you! Also can you tell me how to compute the value of in degree for a directed graph? Out degree is pretty easy. Thanks in advance

[@takshpatel8109]

👌👌

[@ravindrav1895]

Awesome video, I saw many videos but this is the best one , Thank you so much

[@jeevan999able]

Thank you

[@varshinisalian3214]

Thanks ❤️

[@PyTechVision]

You're welcome 😊

[@kishlaykumar2305]

Thanx man!...the way u taught...was amazing ...also much simplified 😍🙏👍

[@NishanPnab]

Very simple explanantion without over complicationg things. Thanks a lot for the video.

[@saiprasad2525]

Very nice explanation what is time complexity is it O(E) and space O(V+E^2)

[@aninditpanigrahi3334]

Sir, the videos were great...please make videos on graph algorithms as well. It's a sincere request

[@PyTechVision]

Sure I will make more videos, It is great to hear it was helpful.

[@nachiketakumar7458]

thank you so much sir... please make lectures on trees also.

[@PyTechVision]

Glad it was helpful, I will cover trees also.

[@thekrat0s215]

Thanks men, best structured video on this Adjacency list Implementation in python

[@vivekpisal2857]

Plz add videos on DFS

[@PyTechVision]

Uploaded th-cam.com/video/FvGCzzfdOLw/w-d-xo.html

[@DrIlyas-sq7pz]

Sir, How to visualize this graph as a diagram?

[@pramodchoudhary2136]

Hi, What terminal are you using ?

[@PyTechVision]

Jupyter notebook

[@adityapratapsingh123]

Can you make a video on adjacency matrix implementation in python? This one is very good .

[@PyTechVision]

Sure, I will make remaining video and complete the playlist after some time.

[@vandit_quantum]

Hey Man, excellent content. Please improve the audio?!

[@PyTechVision]

Sure, I will improve, this was my first video

[@vandit_quantum]

@@PyTechVision great dude.. excellent job, taking feedback!!! Keep up the good work

[@steveraj2115]

Bro how to find the node with the lowest degree and no. edges the graph contains?

[@PyTechVision]

You can iterate over all vertices and check the count of neighbors using adj_list, sum up all counts it will give you degree and find minm of all counts will give u node with lowest degree.

[@steveraj2115]

@@PyTechVision thankyou bro

[@vsaichandu3967]

When we go with deleting a node , won't it takes 0(n) time

[@PyTechVision]

yes it will.

[@dcdb723]

hold on, is_directed=false means not directed, not is_directed means true and directed right?why do you need to append 'u' if it's directed?

[@viswanathans4344]

Helpful Video on Graph Construction. When I try to create, I am getting error like dictionary object has no attribute 'append'. Please tell how to make append work on dictionary objects. Thanks

[@PyTechVision]

Let me check, can you share code ?

[@deepambahre2237]

can you please share your code...

[@PyTechVision]

Yes

[@garvitsingh6914]

Bhaiya bfs dfs pr bhi video baniye

[@PyTechVision]

I have uploaded video on BFS
Please check.

[@mohammadhamza4597]

@@PyTechVision bro pls add DFS too

[@PyTechVision]

@@mohammadhamza4597 Uploaded

[@THELOBABAH]

my nodes are named as 0,1,2....
I am getting keyError everytime. Can you please tell me how to solve that? What should i do now?
PS: i took the the edges from the user.

[@PyTechVision]

Can you share your code ?

[@sagarbora7768]

Bhai code v share krdo

[@PyTechVision]

Will share soon on this link pytech-solution.blogspot.com/2020/12/graph-search-algorithms-python-code.html

[@ardrasurendran2978]

can u please share your code?

[@PyTechVision]

Yes, I will upload the code on this link by tomorrow. pytech-solution.blogspot.com/2020/12/graph-search-algorithms-python-code.html