Category: Breadth First Search

Teaching Kids Programming – Shortest Path Algorithms by Iterative Deepening Search (IDS), Depth First Search (DFS) or Breadth First Search (BFS) on Undirected Graphs

December 18, 2021 algorithms, BFS, Breadth First Search, Depth First Search, DFS, graph, Graph Algorithm, Iterative Deepening Search, python, teaching kids programming, youtube video 2 Comments
Teaching Kids Programming: Videos on Data Structures and Algorithms Shortest Path on Undirected Graphs: DFS or BFS? The Depth First Search and Breadth First Search algorithms can be both …
[Continue Reading...]

Using the Dynamic Programming Algorithm, the Depth First Search or Breadth First Search to Solve House Robber Problem (Largest Sum of Non-Adjacent Numbers)

April 15, 2015 algorithms, BFS, Breadth First Search, c / c++, Depth First Search, DFS, Dynamic Programming, dynamic programming, Memoization, python, Recursion 3 Comments
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each …
[Continue Reading...]