Presentation is loading. Please wait.

Presentation is loading. Please wait.

Around the world in 30 Days By: Rolando Sanchez. Houston Hometown Family lives there Want to go and visit the neighborhood I once lived in.

Similar presentations


Presentation on theme: "Around the world in 30 Days By: Rolando Sanchez. Houston Hometown Family lives there Want to go and visit the neighborhood I once lived in."— Presentation transcript:

1 Around the world in 30 Days By: Rolando Sanchez

2 Houston Hometown Family lives there Want to go and visit the neighborhood I once lived in

3 Dubai Biggest indoor Ski Facility Palm tree shaped island Best shopping in the world Dubai International Film Festival

4 Paris Eiffel Tower Super busy atmosphere Notre Dame Louvre

5 Cabo Miles of wonderful beaches Weather is spectacular Tourist Attraction

6 Cairo Great Sphinx Pyramids Hieroglyphics and Egyptian Culture

7 Distance in miles

8 Price in USD

9 Tree

10

11 NNA / Distance

12 NNA / Price

13 SEA Algorithm for Distance

14 SEA Algorithim for Price

15 Kruskal’s Algorithm

16 Tree Diagram a.k.a. “Brute Force Method” Tree diagram to find the shortest route Always needs a starting vertex Takes a long time Gives you the optimal solution ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Initially I had trouble with the tree diagram but after countless tries, I was finally able to understand it. Oh and it does take a long time and you defiantly need patience

17 Nearest Neighbor Algorithm Heuristic / greedy Quick but not always efficient Always need a starting vertex ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ This was by far the most easiest algorithm and it didn’t take as long as brute force.

18 Kruskal’s Algorithm List the edges from least to greatest Shade the first edge on the list and continue with the rest as long as they don’t form a circuit Continue until a spanning tree results, this will always give you the optimal solution Doesn’t need a starting vertex ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Not bad at all and it was actually quite easy

19 S.E.A. Algorithm List the edges from least to greatest Then you choose the edge with the lowest weight as long as A vertex never has 3 edges extending from it It doesn’t form a circuit before visiting each vertex It doesn’t need a starting vertex Heuristic / greedy ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ The S.E.A. Algorithm was a breeze I didn’t have any difficulties with it.

20 Sources www.Geobytes.com www.expedia.com


Download ppt "Around the world in 30 Days By: Rolando Sanchez. Houston Hometown Family lives there Want to go and visit the neighborhood I once lived in."

Similar presentations


Ads by Google