Skip to the content.

Undecidable Problems, Graphs + Heuristics

Popcorn Hack 1

Possible Routes and Their Costs:

  • A → B → D → E: 4 + 5 + 2 = 11

  • A → C → D → E: 2 + 8 + 2 = 12

  • A → C → B → D → E: 2 + 1 + 5 + 2 = 10

  • A → C → E: 2 + 10 = 12

Homework Hack 1

Question 1

Configuration I: To get from Q to V, you can go directly through the edge connecting them. You can also go through other paths, for example, Q -> T -> U -> V or Q -> R -> S -> V. Since there are multiple possible paths, Configuration I allows for redundant routing.

Configuration II: To get from Q to V, there is a direct connection. You can also go from Q -> R -> S -> V, therefore Configuration II also allows for redundant routing.

Answer: C

Question 2

If we break the U-V conenction and the U-P connection, U won’t be able to route with T. Therefore the two connections need to be broken.

Answer: B