Saurabh vermaedunode.hashnode.dev·Feb 4, 2024Dijkstra’s Algorithm —In this article we are going to understand one of the most popular distance finding algorithm with non-negative edge weights in Graph. (Source: Wikipedia) Problem Statement: Given a weighted graph G with vertices V and edges E, and a source vertex s...Discuss·1 likealgorithms

Jonathan Rufus Samueldijkstra.hashnode.dev·Sep 29, 2023Two Sum - Leetcode #1Question Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can ret...Discussarray

Anton Yarkovoptiklab.hashnode.dev·Sep 17, 2023Exploring well-known path finding algorithms with SFML graphics libraryIntro As someone who is not a professional game developer, I have always been curious about different concepts and enjoy exploring topics that are not directly related to my daily routine. Throughout my career, I have often found myself working on sm...Discuss·1 like·50 readsA-Star

Anton Yarkovoptiklab.hashnode.dev·Sep 16, 2023Universal implementation of BFS, DFS, Dijkstra and A-Star algorithmsIt turns out that well-known algorithms like BFS, DFS, Dijkstra, and A-Star are essentially variations of the same algorithm. In other words, it is possible to implement a universal data structure that can switch between these algorithms without requ...Discuss·42 readsBFS

khandoker ananblog.khandokeranan.com·Sep 1, 2023Popular algorithm and passings for single source shortest pathThree commonly used methods for determining the shortest path from a single starting node require a fundamental understanding of graphs. These algorithms are as follows: Shortest path in a Directed Acyclic Graph (DAG) using topological sorting The ...Discuss·49 readsdijkstra

Peter Hrobardihjital.hashnode.dev·May 2, 2023Finding the shortest path in a weighted graph with PHPIn my last article, I shared my code for searching a path in a graph using breath first search. BFS works well if the graph is not weighted. By the way, if the weight is 1 (or any other constant) for each edge then BFS is finding a similar path like ...Discuss·34 readsPHP

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

Gaurav Sahayuselessmachine.hashnode.dev·Jan 15, 2023Dijkstra's AlgorithmThis algorithm is used to get the shortest path from the source node to all other nodes. Data structures Required: Min Heap(Priority Queue, Set, etc), Arrays. Algorithm: Initialize the distance array with infinity so that later we can update them w...Discuss·1 like·69 readsalgorithms

Gary Vladimir Núñez Lópezblog.garybricks.com·Dec 30, 2022Dijkstra Algorithm - Introduction For BeginnersIntroduction Hello everyone 👋, In today's post I wanted to talk about the famous Dijkstra algorithm, we are going to see what it is, what it's used for, how it works, and the implementation of the algorithm in c++ altho the idea can be applied in an...Discuss·2 likes·371 readsalgorithms

Antonio Cañada Momblantacmsoftware.cl·Aug 20, 2022Create an AutoCAD plugin using cSharp to compute the Shortest Path Matrix in a graphArticle's Purpose Autodesk AutoCAD is a widely known program by engineers and designers used to create 2D and 3D models, it has a great interface with lots of options. It's an intuitive easy-to-learn software which allows the user to achive great res...Discuss·426 readsAutoCAD API