issue 1

Website Content Protection
Arrive in style by booking the the Haunted ATX hearse limo for any event.
BOOK LIMO HERE

Monday, January 12, 2015

Dijkstra's Algorithm







 
For those who are confused about the path A, E, D, F being the candidate for the answer, Dijkstras algorithm is a greedy algorithm meaning that it will always choose the thing that seems to best right now (without regard for how it may impact future choices). In this case, it chose A-B instead of A-E because the distance 4 < 7, hence ignoring the possibility of having a smaller path. This is what makes it greedy; it always goes for the next easiest solution.



Artstrada Magazine PhotobucketBookmark and Share

No comments:

Post a Comment