Graph Search

• Simply treat graph as a tree:

  • Cycles become infinitely deep
  • Nodes visited many times

• ``DAG'' the edges (topo-sort the nodes)

  • Not always easy/possible
  • Still visit nodes many times