Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Depth-First Search vs Breadth-First search

  • Distance
    • DFS: 464 km
    • BFS: 358 km
    • Q1: Can we use an algorithm to optimize according to distance?
  • Time
    • DFS: 4 hours 37 mins
    • BFS: 5 hours 18 mins
    • Q2: Can we use an algorithm to optimize according to time?
  • Search space:
    • DFS: 5 expansions
    • BFS: 26 expansions
    • Not very relevant… depends a lot on how you pick the order of node expansion, never the less BFS is usually more expensive
  • To solve Q1 and Q2 we can apply for example and Best-First Search
    • Q1: the heuristic maybe the air distance between cities
    • Q2: the heuristic maybe the air distance between cities x average speed (e.g. 90km/h)

Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.