3
Good problems [DPV] [DPV] [DPV] [DPV] [DPV] [DPV] [DPV] Problems Page 1

Good problems - Home | Cheriton School of Computer Sciencelapchi/cs341-2016/notes/exercise2.pdf · whether it is possible to perform a tour in which each bridge is crossed exactly

  • Upload
    others

  • View
    2

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Good problems - Home | Cheriton School of Computer Sciencelapchi/cs341-2016/notes/exercise2.pdf · whether it is possible to perform a tour in which each bridge is crossed exactly

Good problems

[DPV]

[DPV]

[DPV]

[DPV]

[DPV]

[DPV]

[DPV]

Problems Page 1

Page 2: Good problems - Home | Cheriton School of Computer Sciencelapchi/cs341-2016/notes/exercise2.pdf · whether it is possible to perform a tour in which each bridge is crossed exactly

Interesting problems

[DPV]

[DPV]

[CLRS]

Challenging problems (optional)

Problems Page 2

Page 3: Good problems - Home | Cheriton School of Computer Sciencelapchi/cs341-2016/notes/exercise2.pdf · whether it is possible to perform a tour in which each bridge is crossed exactly

[CLRS]

[Remark:] There is a very simple program to find an Euler tour. Find it!

[DPV]

Problems Page 3