Breadth-First Search (BFS) is a fundamental graph traversal algorithm that explores nodes level by level. It is commonly used for finding the shortest path, network broadcasting, a

Software Engineer IV | Frontend Developer | React.js | JavaScript Enthusiast

Breadth-First Search (BFS) in Graphs

Hello 👋,I recently built a side project to showcase my Dev.to blogging stats — and it’s live on Product Hunt! 🚀IntroAs someone who loves writing on Dev.to and tracking my bloggin

Introducing Blog Stats Generator: Auto-Updating Blog Cards for Dev.to

IntroductionGraphs are one of the most fundamental data structures in computer science. They consist of nodes (also called vertices) connected by edges. Graphs are widely used in v

Understanding Graphs in JavaScript: Adjacency Matrix vs. Adjacency List

productHunt

leetcode

hashnode

medium

Read the articles written by Karthikeyan Shanmugam on Peerlist

Articles written by Karthikeyan Shanmugam • Peerlist

Sentry

Ruby on Rails

Cypress

React Native

Python (Programming Language)

Scalable Vector Graphics (SVG)

Tailwind CSS

Front-end Development

React.js

JavaScript