Back to Results
First PageMeta Content
Connected component / Longest path problem / Tree / Graph / Topological sorting / Vertex / Connectivity / Edge contraction / Aperiodic graph / Graph theory / Depth-first search / Directed acyclic graph


Algorithms Lecture 19: Depth-First Search [Fa’14] Ts’ui Pe must have said once: I am withdrawing to write a book. And another time: I am withdrawing to construct a labyrinth.
Add to Reading List

Document Date: 2014-12-28 09:02:54


Open Document

File Size: 213,98 KB

Share Result on Facebook

Company

L LP / /

Event

Product Issues / Product Recall / /

IndustryTerm

recursive algorithm / generic depthfirst-search algorithm / earlier generic traversal algorithm / wrapper algorithm / earlier topological sorting algorithm / binary search trees / depth-first search / recursive depth-first search / naïve recursive algorithm / depth-first search algorithm / depth-first search starting / dynamic programming algorithms / whatever-first search / simpler linear-time algorithm / earlier algorithm / http /

Organization

LP(v) / /

Person

Rao Kosaraju / Umberto Eco / William Weaver / Donald A. Yates / Jorge Luis Borges / Jeff Erickson / /

Position

salesman / /

Product

Depth-First Search / /

ProgrammingLanguage

L / /

Technology

earlier algorithm / 3 Algorithms / simpler linear-time algorithm / following algorithm / 9 Algorithms / naïve recursive algorithm / dynamic programming algorithms / search algorithm / earlier topological sorting algorithm / 8 Algorithms / 2 Algorithms / Kosaraju-Sharir algorithm / condensation / wrapper algorithm / modified algorithm / Dynamic Programming Algorithm / 1 Algorithms / 7 Algorithms / earlier generic traversal algorithm / following algorithms / generic depthfirst-search algorithm / 5 Algorithms / 6 Algorithms / 4 Algorithms / topological sort algorithm / /

URL

http /

SocialTag