This preview shows page 1. Sign up to view the full content.
Unformatted text preview: bft(n) visit n mark as visited enqueue n while the queue isnt empty dequeue a node, mark it n for each unvisited successor of n visit it mark as visited enqueue n directed acyclic graphs ex: production of item depends on things getting done first ex: coursework topological sort saturday final 3/15 3-6 3...
View Full Document
- Winter '07