Lecture 1-30-17

Homework 1 Discussion

• Generalized examples

Using topological sort

• Finding longest path in a digraph
  • scheduling (directed acyclic digraphs)
• Algorithm
  • Find value required ending at each vertex
• Other
  • Longest path can’t even be done in polynomial time in graphs with cycles