how we are making the Apple in matrix??
Flood fill. algorithm
We are using the DFS algorithm. That must be explained in the video.
What exactly is your doubt?
My doubt is when we remove first element in set while doing dijektras then time complexity of that??
Set erase operation just takes constant time O(1).
The time complexity of Dijkstra algorithm is O(E log V)
Refer this https://stackoverflow.com/questions/26547816/understanding-time-complexity-calculation-for-dijkstra-algorithm
And in the flood fill. Algorithm. In the video there is a matrix of apple how to make it??
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.