Graph algorithms | Search algorithms

Depth-first search

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking. Extra memory, usually a stack, is needed to keep track of the nodes discovered so far along a specified branch which helps in backtracking of the graph. A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Trémaux as a strategy for solving mazes. (Wikipedia).

Depth-first search
Video thumbnail

Recursion Replacement - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

From playlist Introduction to Algorithms

Video thumbnail

Searching a Tree - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

From playlist Introduction to Algorithms

Video thumbnail

Depth-first search in 4 minutes

Depth-first search in 4 minutes. Code: https://github.com/msambol/youtube/blob/master/search/depth_first_search.py Sources: 1. https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844 2. https://en.wikipedia.org/wiki/Depth-first_search LinkedIn: https://www.linkedin.c

From playlist Search Algos // Michael Sambol

Video thumbnail

Graph Data Structure 3. Traversing a Graph (algorithms)

This is the third in a series of videos about the graph data structure, including how to search a graph by systematically by visiting each and every vertex, namely, how to traverse a graph. Depth first traversal is compared with breadth first traversal, including explanations of how depth

From playlist Data Structures

Video thumbnail

Depth vs Breadth First Search - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

From playlist Introduction to Algorithms

Video thumbnail

DFS Algorithm | Depth First Search Algorithm | DFS In Data Structure | Data Structures | Simplilearn

"DFS algorithm or Depth First Search algorithm is one of the traversal algorithm of graph data structure. In this tutorial beginners will learn about Depth First Search in Data Structure. This DFS in Data Structure tutorial will include practical demo for a better understanding. 🔥Explore

From playlist Data Structures & Algorithms

Video thumbnail

Breadth First without Recursion - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

From playlist Introduction to Algorithms

Video thumbnail

Depth First Search Algorithm | Graph Theory

Depth First Search (DFS) algorithm explanation Source code: https://github.com/williamfiset/algorithms#graph-theory Video Slides: https://github.com/williamfiset/Algorithms/tree/master/slides/graphtheory 0:00 Depth first search as an algorithm template 1:04 Simple DFS example 3:30 Depth

From playlist Graph Theory Playlist

Video thumbnail

Lecture 12 - Topological Sort & Connectivity

This is Lecture 12 of the CSE373 (Analysis of Algorithms) taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 1997. The lecture slides are available at: http://www.cs.sunysb.edu/~algorith/video-lectures/1997/lecture16.pdf

From playlist CSE373 - Analysis of Algorithms - 1997 SBU

Video thumbnail

Graph Algorithms III: Shortest Path - Lecture 8

All rights reserved for http://www.aduni.org/ Published under the Creative Commons Attribution-ShareAlike license http://creativecommons.org/licenses/by-sa/2.0/ Tutorials by Instructor: Shai Simonson. http://www.stonehill.edu/compsci/shai.htm Visit the forum at: http://www.coderisland.c

From playlist ArsDigita Algorithms by Shai Simonson

Video thumbnail

Lecture 13 - Minimum Spanning Trees I

This is Lecture 13 of the CSE373 (Analysis of Algorithms) course taught by Professor Steven Skiena [http://www3.cs.stonybrook.edu/~skiena/] at Stony Brook University in 2016. The lecture slides are available at: https://www.cs.stonybrook.edu/~skiena/373/newlectures/lecture13.pdf More inf

From playlist CSE373 - Analysis of Algorithms 2016 SBU

Video thumbnail

Graph Algorithms II - DFS, BFS, Kruskal's Algorithm, Union Find Data Structure - Lecture 7

All rights reserved for http://www.aduni.org/ Published under the Creative Commons Attribution-ShareAlike license http://creativecommons.org/licenses/by-sa/2.0/ Tutorials by Instructor: Shai Simonson. http://www.stonehill.edu/compsci/shai.htm Visit the forum at: http://www.coderisland.c

From playlist ArsDigita Algorithms by Shai Simonson

Video thumbnail

Breadth-first search in 4 minutes

Breadth-first search in 4 minutes. Code: https://github.com/msambol/youtube/blob/master/search/breadth_first_search.py Sources: 1. https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844 2. https://en.wikipedia.org/wiki/Breadth-first_search LinkedIn: https://www.lin

From playlist Search Algos // Michael Sambol

Related pages

Branching factor | Control-flow graph | Decision problem | Limit set | Polish notation | Group (mathematics) | Parallel algorithm | Degree (graph theory) | Parse tree | Biconnected graph | Graph theory | NC (complexity) | P-complete | Planarity testing | Artificial intelligence | Search algorithm | Stack (abstract data type) | Vertex (graph theory) | Topological sorting | Tree traversal | Breadth-first search | Halting problem | Directed acyclic graph | Search game | Bridge (graph theory) | Iterator | Time complexity | Tree (data structure) | Reverse Polish notation | Iterative deepening depth-first search | Trémaux tree | Algorithm | Analysis of algorithms