the production quality of this video is INSANE! keep it up 🔥🔥🔥
@conaticus10 ай бұрын
Thank you! Not my editing
@CodingWithLewis10 ай бұрын
Quality is top notch as always. Can't wait to see more!
@ljreinworth10 ай бұрын
A bit late here, but definitely like this style of explainer video, and props to the editor for the amazing visuals, too! Congrats on 50K, and here's to more awesome content in the year to come!
@conaticus10 ай бұрын
Thanks so much ♥
@klubkoftaАй бұрын
This is so well made it deserves 100x more views than the current 8k
@noahdev10 ай бұрын
This is incredible! The explanation is worthy of praise on its own but with the animations, visuals, SFXs it is beyond amazing. Good job!
@h4rt36010 ай бұрын
Well done, had to rewatch some parts multiple times, but eventually got it!
@Shot_put10 ай бұрын
Coool buddy
@Odinoz1710 ай бұрын
Love the new stile Con, keep the great work up!!
@realcontentgamer10 ай бұрын
This video editing makes it fun to watch and learn.
@potzko255210 ай бұрын
when you check for the connection you can also assign each node its grandparent, doubles the complexity for the first search but will drastically lower all consequent searches :) great video
@VeryCuul10 ай бұрын
Eyyy new Conaticus upload! Love your vids haha
@rodrigoqteixeira10 ай бұрын
First: video and edition and clear to understand Secound: wow, i would never be able to think for myself of the top and bottom "virtual nodes" that you added. One simple solution to make it from O(n^2) to O(n) :)
@v8metal10 ай бұрын
awesome video. super interesting !
@itr-dev10 ай бұрын
I think this is kind of a bad example, it makes more sense with disjointed nodes than a grid, since you're essentially writing a slower depth first search. It essentially becomes a path-finding problem where you don't care about the speed of the path itself but the time it takes to find any path. But got some ideas on how it can be sped up even further with the specific requirements above, might try and make a video on it.
@planethac10 ай бұрын
The animations are insane
@virusblitz10 ай бұрын
Awesome animations!
@eboatwright_10 ай бұрын
Flood fill algorithm: Allow me to introduce myself
@conaticus10 ай бұрын
Thank you! You are genuinely the first person to point out the name of this to me 😂
@eboatwright_10 ай бұрын
@@conaticus Hahaha yeah, I was so confused like why isn't he just using flood fill... and then I was like ohh... he is using flood fill 😂
@dotak96638 ай бұрын
hy you implemented this all by your self ???
@SteveBClark8 ай бұрын
When a new video is coming vro
@WolfDatka10 ай бұрын
Or just make a compute shader for the simpler scenario or even better make the optimised scenario a complete shader
@AntonioNoack10 ай бұрын
Optimization is pretty worthless without benchmarks, unless you can tell the difference clearly. Please include actual benchmarks before you say recursion is slow.
@conaticus10 ай бұрын
While I didn't do benchmarks, bare in mind this is not my own solution or algorithm. These optimizations have been made by very smart people and have been proven to be very effective for production level applications. Feel free to look into it to find out the performance improvements :)