Where optimal substructure fails

• A

  The longest path may be infinite, so there is nothing to optimise

• B

  Longest paths are not unique, so the recurrence has no single value to settle on

• C

  Two longest pieces may share a vertex, so joining them is not a simple path

• D

  The subproblems overlap too much, making memoisation useless