Priya Mannurrookiecoderblogs.hashnode.dev·Jul 19, 2024Breadth First SearchBreadth first search is used in graph algorithms for traversing through graph. It can be used to sort the graph, find cycles, solve mazes and sudokus. In this algorithm we traverse the neighbours of the nodes first and mark them down. We go on like t...DiscussBFS
Abhilietcode.hashnode.dev·Jun 30, 2024Flood Fill - BFSAn image is represented by an m x n integer grid image where image[i][j] represents the pixel value of the image. You are also given three integers sr, sc, and color. You should perform a flood fill on the image starting from the pixel image[sr][sc]....Discuss·1 likeGraphsBreadth-Fist-Search
Vineeth Chivukulavineethchivukula.hashnode.dev·Jun 29, 2024Understanding Breadth-First SearchBreadth-First Search (BFS) is a traversal technique used in graph data structures that explores all the vertices at the present depth level before moving on to vertices at the next depth level. This technique is often implemented using a queue data s...DiscussBFS
Sammith S Bharadwajsammith.hashnode.dev·Mar 18, 2024TIL but from tweets(I am the guy who can't implement breadth first search without googling)https://twitter.com/ronawang/status/1768337091312943575 Of course I cannot implement BFS without googling lol, not the smartest or sharpest but I can write an article about it though. What is BFS? BFS is a graph traversal algorithm to find the shor...DiscussPython 3
Anil Gulatianilgulati.hashnode.dev·Sep 12, 2023Maven Dependency Resolution: The BF and Skipper AlgorithmNote: This article is a continuation of our Maven series. If you haven't explored the previous articles, you can find them here. Introduction Maven, a fundamental tool in Java project management, plays a pivotal role in handling dependencies and cre...Sriteja Parimi and 1 other are discussing this2 people are discussing thisDiscuss·11 likes·164 readsmaven
Aayush Deshpandeaayush-deshpande.hashnode.dev·Jul 14, 2023The Fundamental Graph Traversal Algorithms: Breadth-First-Search and Depth-First-SearchIntroduction to Graphs Binary trees are a type of data structure used widely in data science and other programming fields, as they allow for efficient data storage in a hierarchical method. This type of data structure represents an acyclic graph with...Discuss·27 readsgraph traversal
MemgraphforMemgraphmemgraph.hashnode.dev·Mar 9, 2023How to Build a Route Planning Application with Breadth First Search and Dijkstra's AlgorithmIntroduction One of the most common applications of graph traversal algorithms is route planning and optimization problems. These can vary from simple things like finding the shortest path from a starting point to a destination to more complex scenar...Discuss·30 readsMemgraph
Aayush Shahaaaaayushh.hashnode.dev·Feb 21, 2023Shortest Path with Alternating ColorsHello and welcome back to the Leetcode daily series! Today we'll be solving a mind-numbingly horrifying problem and of course, it involves graphs. \Sigh\ Let's begin, shall we? Understanding The Problem Take a look at the given problem statement. Yo...Discuss·73 readsLeetcode Daily Solutionsleetcode
Sonali Guptasona123.hashnode.dev·Jan 21, 2023Word ladder 1Explanation This problem 🔗(https://practice.geeksforgeeks.org/problems/word-ladder/0) asks us to find the shortest path from our start word to the end word just by changing a character of the word and that word formed must be present in our list of ...Discuss·30 readsC++
Carlos Severochs.hashnode.dev·Aug 13, 2022LeetCode: 637. Average of Levels in Binary TreeIn this post, I am going to solve and explain the LeetCode question Average of Levels in Binary Tree. Question: Given the root of a binary tree, return the average value of the nodes on each level in the form of an array. Definition: Level average ...Discuss·37 readsPython 3
