--- title: "#dfs articles | Hashnode" description: "Explore 85 articles tagged #dfs on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/dfs" --- Tag # #dfs 85 posts · 2 followers [Mayank Mahajan](https://hashnode.com/@Mayank9056) · [Oct 6](https://hashnode.com/posts/binary-tree-right-side-view-one-node-per-level/6ac53d9bcaa83d2cebce552b) ### [Binary Tree Right Side View: One Node Per Level](https://mayankdev.hashnode.dev/binary-tree-right-side-view-one-node-per-level?utm_source=hashnode&utm_medium=feed) Understand LeetCode 199 once, then solve it twice with right-first DFS and level-order BFS. 10 min read · [mayankdev.hashnode.dev](https://mayankdev.hashnode.dev/binary-tree-right-side-view-one-node-per-level?utm_source=hashnode&utm_medium=feed) [Mayank Mahajan](https://hashnode.com/@Mayank9056) · [Sep 27](https://hashnode.com/posts/binary-tree-traversals-preorder-inorder-postorder-explained/6ab8e40c1e091b12c2d6b99e) ### [Binary Tree Traversals: Preorder, Inorder & Postorder Explained](https://mayankdev.hashnode.dev/binary-tree-traversals-preorder-inorder-postorder-explained?utm_source=hashnode&utm_medium=feed) Understand the three fundamental depth-first traversals using recursion, visual examples, and C++ & Java implementations. 6 min read · [mayankdev.hashnode.dev](https://mayankdev.hashnode.dev/binary-tree-traversals-preorder-inorder-postorder-explained?utm_source=hashnode&utm_medium=feed) [Tanya Agarwal](https://hashnode.com/@tanya2) · [Jun 6](https://hashnode.com/posts/building-a-graph-based-job-recommendation-system-using-bfs-and-dfs/6a2412583480bd6272ebc1c9) ### [Building a Graph-Based Job Recommendation System using BFS and DFS](https://tanyacodes.hashnode.dev/building-a-graph-based-job-recommendation-system-using-bfs-and-dfs?utm_source=hashnode&utm_medium=feed) Introduction Finding the right job opportunity based on a person's skills can be challenging. Many students and professionals struggle to identify career paths that align with their expertise. To addr 5 min read · [tanyacodes.hashnode.dev](https://tanyacodes.hashnode.dev/building-a-graph-based-job-recommendation-system-using-bfs-and-dfs?utm_source=hashnode&utm_medium=feed) [Saipriya M Ravi](https://hashnode.com/@saipriya-mr) · [May 10](https://hashnode.com/posts/decoding-graphs/6a002d2fe3eebc2e20435198) ### [Decoding Graphs: A Pattern-Based Guide to Mastering Network Logic](https://saipriya-builds.hashnode.dev/decoding-graphs?utm_source=hashnode&utm_medium=feed) Graphs. Using real-world examples—from Google Maps' routing to LinkedIn’s connection levels—we map common algorithmic patterns like BFS, DFS, Dijkstra’s, and MST to the problems they solve. Whether you're preparing for a technical interview or building complex software, this post provides the mental framework needed to turn messy nodes and edges into elegant, efficient solutions. 4 min read · [saipriya-builds.hashnode.dev](https://saipriya-builds.hashnode.dev/decoding-graphs?utm_source=hashnode&utm_medium=feed) [Bakundukize Egide Prince](https://hashnode.com/@EgidePrinceBakundukize) · [Apr 1](https://hashnode.com/posts/models-and-algorithms-for-bigdata/69cca1ece4688e4edd8e2e4e) ### [Models\_and\_Algorithms\_for\_BigData](https://prince-bigdata-article.hashnode.dev/models-and-algorithms-for-bigdata?utm_source=hashnode&utm_medium=feed) Models and Algorithms for Big Data Processing to Optimize Joint Ventures between Russia and Burundi 6 min read · [prince-bigdata-article.hashnode.dev](https://prince-bigdata-article.hashnode.dev/models-and-algorithms-for-bigdata?utm_source=hashnode&utm_medium=feed) [Muppidi Srinivas](https://hashnode.com/@srinivas364) · [Mar 16](https://hashnode.com/posts/understanding-graphs-recursion-and-depth-first-search-dfs/69b7c6bb6ca8e7d49b9bc29f) ### [Understanding Graphs, Recursion, and Depth First Search (DFS)](https://srinivastechblog.hashnode.dev/understanding-graphs-recursion-and-depth-first-search-dfs?utm_source=hashnode&utm_medium=feed) Discover how recursion helps DFS explore graphs deeply and efficiently. 10 min read · [srinivastechblog.hashnode.dev](https://srinivastechblog.hashnode.dev/understanding-graphs-recursion-and-depth-first-search-dfs?utm_source=hashnode&utm_medium=feed) [Pranoti Patil](https://hashnode.com/@vibesAI) · [Feb 22](https://hashnode.com/posts/13-depth-first-search-dfs/699b28ebe25d1517a5016763) ### [13.Depth-First Search (DFS)](https://ai-for-multidisciplinary-application.hashnode.dev/13-depth-first-search-dfs?utm_source=hashnode&utm_medium=feed) Definition DFS explores as far down a branch as possible before backtracking.It follows one path deeply until it can’t go further, then goes back and explores other paths. Algorithm (Simple Steps) Pu 3 min read · [ai-for-multidisciplinary-application.hashnode.dev](https://ai-for-multidisciplinary-application.hashnode.dev/13-depth-first-search-dfs?utm_source=hashnode&utm_medium=feed) [Chirag Sindhwani](https://hashnode.com/@chiragsindhwani17) · [Jan 16](https://hashnode.com/posts/the-story-of-selfish-parents-and-selfish-children-the-tarjans-algorithm/696a2465872623887225a2db) ### [The story of selfish parents and selfish children : The Tarjan's Algorithm](https://chiragsindhwani.hashnode.dev/the-story-of-selfish-parents-and-selfish-children-the-tarjans-algorithm?utm_source=hashnode&utm_medium=feed) Tarjan’s algorithm is used to find bridges in a graph. But under the hood, it’s a story of selfish parents and selfish children in a family tree where nobody dies. Imagine a family where ancestors give birth to their children and those children give ... 5 min read · [chiragsindhwani.hashnode.dev](https://chiragsindhwani.hashnode.dev/the-story-of-selfish-parents-and-selfish-children-the-tarjans-algorithm?utm_source=hashnode&utm_medium=feed) [Junghun Kim](https://hashnode.com/@vienna453) · [Jan 6](https://hashnode.com/posts/dfs-bfs-preorder-inorder-postorder/695cf3f06f0d1c80a6a36706) ### [DFS와 BFS, 그리고 Preorder / Inorder / Postorder의 진짜 관계](https://devnote-vienna453.hashnode.dev/dfs-bfs-preorder-inorder-postorder?utm_source=hashnode&utm_medium=feed) DFS와 BFS의 차이와 관계, 각 탐색 전략의 실무 활용 사례를 설명합니다. DFS의 순회 방식, BFS의 특징 등을 다룹니다 4 min read · [devnote-vienna453.hashnode.dev](https://devnote-vienna453.hashnode.dev/dfs-bfs-preorder-inorder-postorder?utm_source=hashnode&utm_medium=feed) [Bikash Mainali](https://hashnode.com/@bikash8848) · [Jan 6](https://hashnode.com/posts/dfs-traversal-for-undirected-unweighted-graph/695c787fc30bb3b03ec6562c) ### [Depth First Search (DFS) Traversal: for Undirected Unweighted Graph](https://dsa-3956.hashnode.dev/dfs-traversal-for-undirected-unweighted-graph?utm_source=hashnode&utm_medium=feed) DFS Traversal — 4 Easy Rules Rule 1 — Start Put the starting vertex into a stack Keep an empty visited set stack.push(start); Set visited = new HashSet<>(); Rule 2 — Take from Stack While the stack is not empty: Pop the top vertex fro... 7 min read · [dsa-3956.hashnode.dev](https://dsa-3956.hashnode.dev/dfs-traversal-for-undirected-unweighted-graph?utm_source=hashnode&utm_medium=feed)