ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
thank you mx. russell :,,)
Best explanation I've seen of this algo online, thank you!
betichod tereko smajh main kaise aa rha hai madarchod.Translation: you daughter fukker how do you get this shitty explanation you perfect as* hole
a perfect explanation! Thanks!
Nice explanation, thanks
you just saved my life. thank you
Thank You, Very much :)
very high quality
I must be hungry because I heard Breakfast Search
Can you show the worst case of this algorithm? Thank you so much!
Thuận Nguyễn-Thái Hi, the big O notation I was using does describe the worst case. hope this helps.
why is the running time of BFS not O(V+E) ?
You are right, it is. However, in this special case O(|V|) = O(|E|) since if O(|V|) > O(|E|) then there will be free hanging nodes - these can never match so can be removed. This means we can simplify to O(V+E) to O(E).
Its BREADTH not BREAKFAST just say BFS if u reallly canttttttt
😂😂
![เจ้าผู้เดียว - ดิด คิตตี้ [OFFICIAL MV]](http://i.ytimg.com/vi/q0NLCYKBOTo/mqdefault.jpg)
thank you mx. russell :,,)
Best explanation I've seen of this algo online, thank you!
betichod tereko smajh main kaise aa rha hai madarchod.
Translation: you daughter fukker how do you get this shitty explanation you perfect as* hole
a perfect explanation! Thanks!
Nice explanation, thanks
you just saved my life. thank you
Thank You, Very much :)
very high quality
I must be hungry because I heard Breakfast Search
Can you show the worst case of this algorithm? Thank you so much!
Thuận Nguyễn-Thái Hi, the big O notation I was using does describe the worst case. hope this helps.
why is the running time of BFS not O(V+E) ?
You are right, it is. However, in this special case O(|V|) = O(|E|) since if O(|V|) > O(|E|) then there will be free hanging nodes - these can never match so can be removed. This means we can simplify to O(V+E) to O(E).
Its BREADTH not BREAKFAST just say BFS if u reallly canttttttt
😂😂