Видео

Thanks for this easy explanation 😊

Amazing sir, you explained well 👍

Good Explanation

Nice Explanation

Super method

finally found BFS implementation in python without OOPs. Grateful!✌

sir ye code kysy mil skta?

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

parent[v] = u; what that line do? I don't understand???

Bro you're fucking good

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?

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

u make it so easy mannn..dammn good..

dfs_util("A") print(dfs_traversal_output) are giving me a type error 'dict is not callable'

nice bro, A very good explanation.

Sir Allah apko aur apke family ko mahfooz rakhay aur apko jannat mein jagah de. Inshallah

great work easy explanation

why is the parent set to none?

why is the level set to -1?

Please upload more videos on graphs, your way of explanation is outstanding 🥰.

What software are you using?

Thank You So Much Brother. 😇

Nice explanation! What if the graph is given as an adjacency matrix instead?

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

what we need to do if the path is not closed one

kindly upload the code on git

bahut tagda....!!!!!!

Deep explanation 🔥 this is what I've been looking for since 4 days 😂 Thanks man 👍🏻

Thank you sir. You explain very well, please make more videos on other topics in python.

Which ide is this

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

Hello everybody, I feel learning to code can be simpler using a software like in this video .I am very much interested to know what is the best software that can be used to record videos and learn a better and faster way.

Bro nice work, why don't you upload more videos??

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

brother I wished you have explained MinMax Algo, A*, Alpha-Beta and Bayseain because your explanation are the best.

bro, this code works perfectly fine for a non cyclic graph. But when it comes to cyclic, the visited vertex has one or more duplicates. Also can we apply bfs for cyclic graphs also.

Sir please make videos on Algorithms liks bactracking greedy algorithm etc

Excellent Explanation... You will live on in this video forever.... 👏

Best video man. Absolutely loved the way you explained.

getting an error in the if not visited[v] as bool object not subscriptible pls help

if there is multiple paths to a node with the same level, e.g. 1 to 4 where: 1: 2, 3 2: 1, 4 3: 1, 4 4: 2, 3 how can we choose the path where the answer is smallest, i.e. 1 2 4

adj_list ={} for i in range(9): j,k = input().split() adj_list[j]= adj_list.get(j,[]) + [k] adj_list[k]= adj_list.get(k,[]) + [j] print(adj_list) A B A D B C D E D F E F E G F H G H

Sir do you have python code for 8 puzzle problem. Could you please share

For stack, does it have to be directed graph example only?

Thx a lot. Helped me with my assignment.

Amazing video sir 😊🤩

Great explanation..

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