TADM2E 5.31

From Algorithm Wiki
Revision as of 18:14, 11 September 2014 by Algowikiadmin (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
  • For BFS, queues are used.
  • For DFS, stacks are used. Normally in real implementation, we use recursion in place of an explicit stack.