SShortSingh.
TopTechnologyAI & MLStartupsProgrammingScienceBusinessFinanceCrypto & Web3World
Back to feed
Programming

Topic 13: Shortest Path Algorithms 🚀

0
·8 views

Now we move deeper into graphs. The key interview question is: Given a graph, how do I find the minimum-cost path from one node to another? The correct algorithm depends mainly on edge weights. Memorize this table: Graph Algorithm Unweighted graph BFS Weights are only 0 and 1 0-1 BFS Non-negative weights Dijkstra Negative weights possible Bellman-Ford All-pairs shortest paths Floyd-Warshall DAG Topological-order shortest path Unweighted → BFS Non-negative weighted → Dijkstra Negative edges → Bellman-Ford You already saw this with BFS. Example: 0 --- 1 --- 2 | 3 Every edge has equal cost.

Read the full story at DEV Community

This is an AI-generated summary. ShortSingh links to the original source for the complete article.

Discussion (0)

Log in to join the discussion and vote.

Log in

Related stories

0
ProgrammingDEV Community ·

From JavaScript Basics to Deployed Websites: A Structured Learning Path for Aspiring Web Developers

Technical Reconstruction: From JavaScript Basics to Deployed Websites Transitioning from basic JavaScript knowledge to building and deploying a functional website is a complex journey that demands a structured learning path. Without a clear roadmap, learners risk wasting time on irrelevant resources, missing critical skills, or becoming overwhelmed by the complexity of web development, potentially abandoning their goals. This section dissects the essential steps, tools, and concepts required to bridge this gap, emphasizing causality and practical implications. Impact: Establishes core programm

0 comments Read more at DEV Community
0
ProgrammingDEV Community ·

Microsoft SharePoint exposure: 163,266 matching assets and a code injection flaw that needs only a user account

Microsoft SharePoint exposure: 163,266 matching assets and a code injection flaw that needs only a user account SharePoint is one of the few enterprise platforms where an ordinary authenticated user is a meaningful attack position. The exposure figure for SharePoint therefore needs to be read alongside its authentication model rather than in isolation. Every count in this article comes from ZoomEye international, queried through the official Python SDK on 3 October 2026 between 02:33 and 02:35 UTC. All queries used the sub_type=all scope, which covers devices and websites, with a page size of

0 comments Read more at DEV Community
0
ProgrammingDEV Community ·

Can AI crawlers read your site? I checked mine

First published on yappatyih.com. An AI crawler access check is a test of whether the bots behind ChatGPT, Claude, Perplexity and the others can fetch your pages, by requesting a page with each bot's name and reading the status code. On 30 September 2026 I ran one on this site: eight crawler names, eight answers of 200. Nothing was keeping the machines out. What the same audit found instead was a line in my own robots.txt, Disallow: /og/, that blocked the preview image of every page without a cover, plus a sitemap address that returned 404, one company with two ids, and dates that could claim

0 comments Read more at DEV Community
0
ProgrammingDEV Community ·

A Valid PNG Can Still Be the Wrong Tesla Wrap: Debug the UV Map First

Your file is PNG, its dimensions look right, and the export finishes without an error. Then a stripe lands on the wrong body panel. A valid image can still use the wrong template or place artwork in the wrong mapped region. A Tesla custom wrap is artwork for a digital vehicle visualization. Treat its template as a mapping contract: select it before drawing, preserve its canvas, and inspect where the pixels land before diagnosing the transfer process.

0 comments Read more at DEV Community