68. BFS implementation using C
Вставка
- Опубліковано 25 сер 2024
- Program to implement BFS traversal using C language with example has been discussed. Users will get a clear idea about the concept of adjacency matrix and BFS traversal using queue. For complete program click on the below link.
github.com/sam...
Thanks for the simple program code....it is really helpful to me 🤝🤝
Thank you for watching ❤️
Thank you for giving code in description
Thank you for watching ❣️
MY MAN DID DFS IN BFS COOL
thank you so much sir for explaining this easily
Thank you for watching ❤️
sir very very thank you for simpler code
great explanation for beginners really enjoyed your explanation thank you.
Thank you so much ❣️❣️... Keep watching..
@@dr.samaleswariprasadnayak8664 sir i am getting wrong answer with this code
@@gnaneshwar1492Try to complete correctly. Else share your email id. I will share the code.
@@dr.samaleswariprasadnayak8664 sir the output is coming wrong
@@moonwalkingdancer8369 Thank you for watching. Send your email id I will share the program.
Thankyoou soo much tommorow is my test
Thank you for watching ❣️
Thank you so much Sir
Thank you for watching ❤️
This code is for Depth first, not BFS.
Thank you for watching ❣️. Send an email to samaleswari.nayak@gmail.com. I will share the code and you will test again.
we are same somehow in the same universe
If l want to start from vertex 1 then where do l need to make changes....l tried a lot but not giving correct result
I need to check the code again. Share your mail id with samaleswari.nayak@gmail.com. I will share the solution.
thanks sir
Sir let me know if a grid is given and we can travel only diagonally
What logic should we use??
Thank you for watching ❤️. It will be difficult to make you understand through chat as the logic is bit tricky and lengthy. So kindly follow this link.
www.google.com/amp/s/www.geeksforgeeks.org/zigzag-or-diagonal-traversal-of-matrix/amp/
@@dr.samaleswariprasadnayak8664 Thank you sir for the response.
Really appreciate it.
It will help me a lot.
explain adjacency list.
Nice video.
Adjacency list is formed by visiting to the directly connected outward nodes. For details you can watch the video. Thank you for watching. Recommend others also. ❤️
your github code is not working . can you check that please
Thank you for watching ❤️. Definitely.
helo mr Samaleswari.. can u help me?? i will make this bfs code for winbatch file.. can u help me?
Thank you for watching ❤️. I will definitely give it a try.
Where Is Source Vertex
Thank you for watching ❤️. Any vertex can be considered as source but here we have considered one to solve the problem.
sir bfs queue se implement hota hai lekin aapne queue ka use hi nhi kiya
Thank you for watching
i don't understand dfs bfs step and its resultant 🥲 ...... from your video sir
Thank you for watching ❤️... Go through any book and then watch it again.
The first example answer and code answer are different
Thank you for watching ❤️. I have written the code by considering a single example. You can try others also.
But this is as it is a dfs code.... How it works
Thank you for watching. ❤️
Program output is wrong
Thank you for watching. samaleswari.nayak@gmail.com. send an email. I will share the program with you.
Speak
loudly
Thank you for watching ❤️. Definitely I will take care..
But next time please explain more
Thank you for watching ❣️
Thank you sir
Thank you for watching ❣️
Isn't it DFS
Thank you for watching ❤️. It's BFS. Check the video of DFS.
@@dr.samaleswariprasadnayak8664 But didn't you use Function stack to implement BFS supposed to be using queue
@@kunalsingh2505 I have used Queue while describing the example. Kindly check.
ciro ciro
Sir ans is diff when u solve manually and run d program
Thank you for watching ❣️.. It depends upon how you are inserting the values in Queue. It may come different.
Is it ok sir to get lik that?
@@akulasreesuravarjjula7529 Yes that's ok.
This is not a bfs it is a dfs
Thank you for watching.
thanks sir
Thank you for watching ❣️