Kaameshwaran Vplutodev.hashnode.dev·Jan 5, 2025Graph Theory Made Easy: My Journey Through Key Concepts (Part 1)My Week with Graph Theory: Part 1 Introduction to Graph Theory: A Personal Learning Journey When I first started, graphs seemed overwhelming. While I was familiar with trees from data structures, graphs felt more complex. I began by understanding the...Graph
Saumyaa Gargsaumyaagarg.hashnode.dev·Dec 28, 2024Day 32: Graphs - Hard ProblemsWelcome to Day 32 of my 100 Days of DSA challenge! Today’s focus was on tackling hard graph problems, pushing the boundaries of algorithmic thinking and optimization. The tasks included solving challenges like finding the smallest cycle, identifying ...10 likesWeek 5DSA
Saumyaa Gargsaumyaagarg.hashnode.dev·Dec 27, 2024Day 31: Advanced GraphsWelcome to Day 31 of my 100 Days of DSA challenge! Today’s focus was on advanced graph algorithms, delving into topics like shortest paths in DAGs, handling negative weights with Bellman-Ford, and exploring critical graph structures with Tarjan’s and...2 likesWeek 5DSA
Saumyaa Gargsaumyaagarg.hashnode.dev·Dec 26, 2024Day 30: Advanced Graphs and Union-FindWelcome to Day 30 of my 100 Days of DSA challenge! Today, I delved into advanced graph techniques and the Union-Find algorithm, a powerful tool for managing disjoint sets and solving connectivity problems. From detecting cycles in graphs to merging a...10 likesWeek 5DSA
Saumyaa Gargsaumyaagarg.hashnode.dev·Dec 21, 2024Day 25: Advanced GraphsWelcome to Day 25 of my 100 Days of DSA challenge! Today, I explored advanced graph algorithms, including Dijkstra’s for shortest paths, Kruskal’s and Prim’s for minimum spanning trees, and topological sorting. These algorithms are essential for solv...10 likesWeek 4DSA
Kumar Spandan Pattanayak5p7ro0t.hashnode.dev·Dec 21, 2024Solving Leetcode 2872: Find the Maximum K-Divisible ComponentsLeetcode Question Link: https://leetcode.com/problems/maximum-number-of-k-divisible-components/description/ Intuition Initially, I thought of approaching it with array and tree traversal but didn't think of any other method. I got struck on how to pr...Python
Saumyaa Gargsaumyaagarg.hashnode.dev·Dec 20, 2024Day 24: Graph TraversalsWelcome to Day 24 of the 100 Days of DSA challenge! Graph traversal methods such as BFS and DFS are fundamental for exploring and analyzing graph structures. Today's focus was on leveraging these techniques to solve practical problems, including shor...10 likesWeek 4DSA
gayatri kumargeekee.hashnode.dev·Oct 19, 2024The Ant Colony’s NetworkImagine walking through a vast ant colony where thousands of chambers are interconnected by tunnels. Each tunnel leads to a different chamber, and every chamber has multiple paths leading out. This labyrinth is more than just a network of tunnels; it...30 likesData Structures and AlgorithmsGraph
Rohit Gawanderohit253.hashnode.dev·Oct 14, 2024Chapter 39: Graphs (Part 5)"Mastering Graph Algorithms: Cheapest Flights, Connecting Cities, and More in Java" Introduction In this chapter, we delve deeper into the fascinating world of graphs, focusing on practical applications related to finding optimal paths and connectio...DSA(Data Structure and Algorithm) In JAVARohitGawande
Kofi / Illestpreachablog.illestpreacha.com·Oct 9, 2024Mathober2024_FlexibleGraphableOres For my eighth sketch of Mathober2024, GraphableOres is coded in Python with a Ore-like graph that is being stretched and morphed through Glitchlab. Flexible Graph is the 7th Prompt for this year’s Mathober. Poetry Shaking and Flipping T...Python
