3.6.09. Simplify

  • Route/path to information
    • Introduction
      • Join is an arc, join time is arc length
      • Table is a node
    • Graph traversal problem
      • Dijkstra's shortest path
        • Heuristic
          • Search for optimal
          • General, each node defines a population of tuples