Тёмный
Learn by Example
Learn by Example
Learn by Example
Подписаться
Hello! I am Himangshu, and this channel is all about solving problems and understand deeper concepts in computer algorithms, physics and math. I believe the best way to understand anything is through an example, and hence, this channel is a small effort to explain my understanding of a concept by means of a problem or puzzle that uses the concept.

If you'd like to support my endeavour to create such content more regularly, you can support me via Patreon : patreon.com/LearnbyExample
Комментарии
@Perspectologist
@Perspectologist Год назад
This was very cool. Thanks for sharing this with us. It might be better to use a larger font size so we can see the code your are showing more easily. I’m just getting started in Bevy, so it is cool to see what other people are doing in it.
@ghashy4501
@ghashy4501 Год назад
It has a lot of potential, awesome work!
@PecoDanajlovski
@PecoDanajlovski Год назад
This is great, please continue, the content is great.
@nicklansbury3166
@nicklansbury3166 Год назад
Fascinating. Thank you. I'm going to study this in depth as it looks really interesting.
@MrEnder0001
@MrEnder0001 Год назад
Amazing would love to see other procedural objects or more parameters like leaf shape. A procedural forest would be amazing
@learnbyexample24
@learnbyexample24 Год назад
Stay tuned!
@CosmicLF
@CosmicLF Год назад
You are amazing this helped me so much
@debangadutta4746
@debangadutta4746 Год назад
Hi Jintu Dada, I'm glad to see your new video after such a long time. I hope you are doing well😊.. I have some important things to talk to you about, so please let me know when you are free. I will reach out to you on Hangouts soon ..
@cheezeworm
@cheezeworm Год назад
tsp is not np-complete...
@tamseel101
@tamseel101 Год назад
I used your code but it only generated graph. What do u do to auto solve after run?
@learnbyexample24
@learnbyexample24 Год назад
You got to check the key binding for the 'optimize' action.
@aenber
@aenber Год назад
Really good Video:) thank you 😊
@greglouis5779
@greglouis5779 2 года назад
What if my graph have n number of nodes, how can I modify the ACO to travel from a specific source to a specific destination without passing through all the n number of nodes but only the nodes to the destination and that's it?
@learnbyexample24
@learnbyexample24 2 года назад
You just have to sample paths from the source S to the destination D, rather than all sources and destinations.
@36nibs
@36nibs 2 года назад
this doesnt account for alternative directions and axis since its an ant colony you should have 6 axis (up and down) of direction instead of 4 (compass directions)
@learnbyexample24
@learnbyexample24 2 года назад
The graph is a planar embedding only, actual physical paths can be three dimensional sure.
@wolfinthesuit
@wolfinthesuit 2 года назад
I hate those damn salesmen can't they solve they problems? I already have problems by my own!!
@ibrahimaba8966
@ibrahimaba8966 2 года назад
😅😅 this is quite easy
@bpw0141
@bpw0141 3 года назад
Hi sir can i contact you i have a TSP problem where i work in Indonesia, i would be very happy if you give your email address so i can contact you Thank you
@patrickstival6179
@patrickstival6179 3 года назад
Nice video. I should probably try to implement this
@mohsenabdelaziz9476
@mohsenabdelaziz9476 3 года назад
thanks alot for ur great work
@learnbyexample24
@learnbyexample24 3 года назад
At around 9:45, I mention that the maximum prime that we need to compute is sqrt(U). Basically what I meant to say is p <= sqrt(U) and hence p_max = sqrt(U). At around 14:00, I confuse the explanation of p_max again in the code. The comment should just read ‘max prime number to compute’. Or ‘lower bound of the prime number range to compute’. Apologies for completely messing up an explanation that should be clear enough to you :)
@learnbyexample24
@learnbyexample24 3 года назад
Correction : At 4:36, we are looking at positions which are a distance of 4 units apart, hence after 8, the next value should be 12 or greater, and not 13 or greater as I mentioned in the video.