@tanaytoshniwal

Tanay Toshniwal

@tanaytoshniwalGurugram, IndiaJoined December 2024

A developer by profession and a musician by passion, with heart of a biker

About

Nothing here yet.

Available for

Nothing here yet.

Tanay Toshniwal's blogs

Coding Canvascoding-canvas.hashnode.dev11 posts

Understanding Depth-First Search (DFS) in Graphs Using C++

Depth-First Search (DFS) is a fundamental graph traversal technique that explores as far as possible along each branch before backtracking. It is widely used in various applications such as detecting cycles, finding connected components, and solving ...

Dec 31, 2024 · 3 min readcoding-canvas.hashnode.dev

Exploring Graphs with Breadth-First Search (BFS) in C++

Graphs are fundamental structures in computer science, representing networks such as social connections, web pages, or city maps. One popular way to traverse graphs is through Breadth-First Search (BFS), a systematic level-by-level exploration method...

Dec 31, 2024 · 3 min readcoding-canvas.hashnode.dev

Exploring Graphs with BFS: A Hands-On Implementation in C++

Graphs are one of the most versatile data structures in computer science, used to model relationships and connections. Breadth-First Search (BFS) is a powerful algorithm for exploring a graph level by level. This blog delves into the BFS implementati...

Dec 31, 2024 · 3 min readcoding-canvas.hashnode.dev

Understanding Doubly Linked Lists in C: Insertion and Traversal

Doubly Linked Lists (DLL) are a type of linked list where each node contains two references (or pointers) — one pointing to the next node and another pointing to the previous node. This structure allows traversal in both directions, making it more fl...

Dec 31, 2024 · 5 min readcoding-canvas.hashnode.dev

Introduction to Circular Linked Lists in C

A Circular Linked List is a variation of a linked list where the last node points back to the first node, creating a circular structure. This data structure is often used in applications like real-time scheduling, buffer management, and more. In this...

Dec 31, 2024 · 4 min readcoding-canvas.hashnode.dev

Tanay Toshniwal

About

Available for

Tanay Toshniwal's blogs

Understanding Depth-First Search (DFS) in Graphs Using C++

Exploring Graphs with Breadth-First Search (BFS) in C++

Exploring Graphs with BFS: A Hands-On Implementation in C++

Understanding Doubly Linked Lists in C: Insertion and Traversal

Introduction to Circular Linked Lists in C

Search Hashnode

Tanay Toshniwal

About

Available for

Tanay Toshniwal's blogs

Understanding Depth-First Search (DFS) in Graphs Using C++

Exploring Graphs with Breadth-First Search (BFS) in C++

Exploring Graphs with BFS: A Hands-On Implementation in C++

Understanding Doubly Linked Lists in C: Insertion and Traversal

Introduction to Circular Linked Lists in C