Search Results

5 matches found for 'dfs'

4 Line Depth-first Search

... in nature, thus a stack becomes very useful when defining the algorithm. The algorithm def dfs(parent, vertex): for neighbor in vertex: if neighbor not in parent: parent[neighbor] = vertex dfs(parent, vertex) The pseudocode above represents the core algorithm of depth-first search.

May 7, 2017

Find a path in a maze from start to finish

... "x y") def find_paths(maze, start, end): path = [] def _dfs(curr): if curr.x < 0 or curr.x >= len(maze) \ or curr.

December 4, 2018

Topological Sorting

There are two ways to do topological sorts: DFS To perform a topological sort via DFS, you will need the following: Adjacency Lists A "visited" set Recursion Recall that DFS itself will not give you nodes in topological ordering.

March 6, 2021

Algorithm Handbook

Introduction Welcome to the algorithm handbook wiki! In this wiki you will find a mini-cheat sheet overview of data structures, and examples of their usages in modern languages. Algorithm problems can be found here.

June 18, 2017

Flip adjacent colors in a 2D matrix

Problem Given a 2D array of black-and-white points and an entry point, flip the color of all points connected to the entry point (including the entry point itself). Input A: 2D boolean array of size greater than \(n\) \times \(m\), where False represents the color black and True represents the color white.

December 5, 2018