Lokesh Kumar Jhajhalokesh.hashnode.dev·Jan 12, 2025Building an Efficient and Scalable Web Crawler: A Beginner's GuideBuilding a crawler which comes with its own set of challenges, such as handling dynamic content, infinite scrolling, and varying URL structures across different platforms. In this blog post, I’ll walk you through how I built a scalable web crawler th...web crawler
Arka Infotecharkainfotech.hashnode.dev·Jan 10, 2025Graph Algorithms Every Developer Should KnowIntroduction Graphs are a fundamental data structure used to model relationships and connections in various domains, from social networks to transportation systems and even the internet. A graph consists of vertices (or nodes) and edges (or arcs) con...10 likescoding
Arka Infotecharkainfotech.hashnode.dev·Jan 10, 2025Breadth-First Search (BFS) vs Depth-First Search (DFS)Introduction When it comes to traversing or searching through data structures like trees and graphs, Breadth-First Search (BFS) and Depth-First Search (DFS) are two of the most fundamental and widely used algorithms. Both algorithms are designed to e...10 likesGraphAlgorithms
Vivek Khatritech.peculiarvivek.com·Jan 1, 2025LLMs are going to take away our jobsI came across a question on twitter/X. I had some ideas on how to solve it. But then I thought why not ask our LLMs if they can solve it. So let’s take a look at the question. I didn’t wanna type the question but Multi-modal LLMs for the win! Claude...1 likellm
Aaqib Bashir Mirbreadth-first-search.hashnode.dev·Dec 9, 2024Breadth-First Search (BFS): A Beginner's Guide.What is BFS? Breadth-First Search (BFS) is a graph traversal algorithm used to explore nodes and edges of a graph. It starts at a given source node and explores all its neighbors before moving on to the neighbors of those neighbors. BFS guarantees fi...BFS
Teja Illaakadurga.hashnode.dev·Oct 2, 2024DFS and BFS on a Single GraphBFS and DFS Algorithm on a single Graph Take an Example of the below Graph import java.util.*; public class Main { public static class Graph { int v; int e; List<List<Integer>> arrList; public Graph(int v, int e) { this.v...DFS
Rohit Gawanderohit253.hashnode.dev·Sep 29, 2024Chapter 44: Graphs (Part 1)In this chapter, we will embark on an in-depth exploration of Graphs, one of the most versatile and widely-used data structures in computer science. Graphs play a crucial role in representing relationships between entities, making them indispensable ...DSA(Data Structure and Algorithm) In JAVAData Structures and Algorithm
Jyotiprakash Mishrablog.jyotiprakash.org·Sep 25, 2024Introduction to GraphsA graph is a collection of nodes (also called vertices) and edges that connect pairs of nodes. Graphs are an abstract data structure used to represent relationships between objects. A graph G is typically denoted as G = (V, E), where: V is the set o...10 likes·1.6K readsgraphs
Dharansh Neemadharanshneema.hashnode.dev·Sep 25, 2024DFS and BFS in graph using Adjacency matrixTerminologies Graph : In DSA generally Graph means set of nodes which are connected to each other (not necessarily). A graph can be collection of nodes which are not connected to each other(disjoined graph). The graph is composed of Vertex and Edges...10 likesGraph
Chetan Dattachetan77.hashnode.dev·Sep 23, 2024Height of a Binary Tree - Max DepthProblem Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. (link) Example 1: Input: root = [3,9,20,null,null,15,7]...LeetcodeHeight of a Binary Tree
