Shortest Paths – 4 (an alternative approach) Share this: Click to share on X (Opens in new window) X Click to share on Facebook (Opens in new window) Facebook Like Loading... Related
You can start from A if you like, that way you will calculate routes from B to A which will be the same thing 🙂 Try it for yourself and see. It is just a bit easier to visualise “paths ending in B” etc, nothing rigid about it. regards J Reply
CAT-holics 
hey, where is the post to apply this approach to broken grid ?? Eagerly waiting..
In the next post…!
regards
J
what is if we are asked to find shortest distance alone.
why did we start from B? What happens if we start from A?
You can start from A if you like, that way you will calculate routes from B to A which will be the same thing 🙂 Try it for yourself and see. It is just a bit easier to visualise “paths ending in B” etc, nothing rigid about it.
regards
J
Yes. Getting same value. Thank you sir!
That is a unique take on such problems, thanks J