วีดีโอ

The greatest teacher of all time.

Thank youuuu!.

Great lesson

Very clearly defiened each step

nice understand tq

Very good example ❤

Morar Motorway

Best best sir, u could have uploaded for dfs too🤧

is it hard to understand this if we take matrix as i am trying to understand by matrix previously

This is great. You're easy to follow. Explains very clearly

loved the extra explanation neeeded that thanks

Very good video

Hi! Thank you so much for sharing your implementation. I have a question though, what's the time complexity? I've seen that the bfs algorithm has a time complexity of O( V + E), but I'm still a bit confused. Again, thank you so much, it was very useful!

thank u sir, good understanding your concept what u taught

very good explanation

such a bad explaination when you cam to explain bfs fuction you directly jumped on last print statement lol

Hello sir, it is a good explanation. can you please share the code

This was the breadth first search sir

Sorry, I'm a novice in python, what library did you use? Thanks for all content it's good.

Good job sir

nice video, can you pls use it to create an MPPT algorithm to maximize the PV energy extraction from a PV module on MATLAB with actual PV system parameters?

Sir there is no clarity in the map diagrams, and numbers are not visible

Are you going to provide all the topics from Artificial Intelligence: A Modern Approach? Thanks for this tutorial.

Kindly put a similar python video for DFS also

really good

WHERE IS FIND? WHAT DO YOU FIND? ALL V'S OF GRAPH? WHY DONT LOOP OVER GRAPH DICT FOR THE SAME RESULT?

THANK YOU SO MUCH!

Top notch explaination. Godspeed

I was trying to understand it for hours!! that's exactly what I needed! thank you so much

I took the liberty to improve the code a bit. Added code to print out the search activities at each iteration. This way, you can clearly see how the search performs its search task....Good luck. graph = {'5': ['3', '7'], '3': ['2', '4'], '7': ['8'], '4': ['8'], '2': [], '8': []} ListOfVisitedNodes = [] listOfNodesToBeTraversed = [] def breadthFirstSearch(graph, startFromNode): ListOfVisitedNodes.append(startFromNode) listOfNodesToBeTraversed.append(startFromNode) while listOfNodesToBeTraversed: currentNode = listOfNodesToBeTraversed.pop(0) print(' Current node is {0}'.format(currentNode)) if len(graph[currentNode]) == 0: print('NOTE: node {0} is also a leave, therefore it has no child node(s) '.format( currentNode)) for childNode in graph[currentNode]: if childNode not in ListOfVisitedNodes: ListOfVisitedNodes.append(childNode) print('Adding child node "{0}" to the list of the visited nodes => {1}'.format( childNode, ListOfVisitedNodes)) listOfNodesToBeTraversed.append(childNode) breadthFirstSearch(graph, '5') print('The sequence of nodes traversal => {0}'.format(ListOfVisitedNodes))

Oh my this is what i've been looking for!

Can you give a scenario where GBFS will get stuck in a loop? Because if it keeps the nodes it has expanded in memory, it can back track to other nodes, therefore it won't cause looping. I hope you can give an example of Looping. Thank you.

Thanks for the explanation!

Thank you so much sir ❤️🙏🙏

can you make video on DFS also .

it is so well explained please make a video on dFS, dls, uniform cost search, and greedy best-first search implementation in Python this is the easiest code and explanation in all the videos available on youtube

Thank you sir this is a very simple and good explanation!

Best explanation, Thank u very much!

it seems, that in the 2nd epoch delta -w-1 for second and third object are using different learning rate than the others. Is it possible those numbers were wrongly calculated?

great video

this video is great... you have explained it very well... and you have earned a subscriber.... i have left the half video just to give a time at write it for you.. sir please keep making such videos.. thankyou soo much.

Super 💕

Thank you!

You made it so simple to understand with those step by step example

👍

THank you ,,, this really hepled me

Good one

this code is not running

I spent with my hours clear doubt and more spent time

Very nice explanation, thank you. It would be helpful if you please explain the Cat swarm optimization algorithm