---
title: "Discussion on \"How OSPF Routers Find the Fastest Path, Using Dijkstra's Algorithm\" | Hashnode"
description: "Discussion on \"How OSPF Routers Find the Fastest Path, Using Dijkstra's Algorithm\". Why the shortest-looking route isn't always the cheapest one, and how routers actually decide"
url: "https://hashnode.com/posts/dijkstra-algorithm-ospf-routing/6a7ac4eb796f5e9c3570adb9"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [How OSPF Routers Find the Fastest Path, Using Dijkstra's Algorithm](https://bibashshrestha.hashnode.dev/dijkstra-algorithm-ospf-routing?utm_source=hashnode&utm_medium=feed)

Why the shortest-looking route isn't always the cheapest one, and how routers actually decide

Aug 11 · 5 min read · bibashshrestha.hashnode.dev  
Read the article

-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#computer-science](https://hashnode.com/tag/computer-science)
-   [#networking](https://hashnode.com/tag/networking)
-   [#systems-design](https://hashnode.com/tag/systems-design)

## Written by

[Bibash Shrestha](https://hashnode.com/@bibash28)

@bibash28 · Kathmandu, Bāgmatī, Nepal

  
[View profile](https://hashnode.com/@bibash28)

Building apps, exploring computer science

Mobile app developer with more than half a decade building production apps. Interested in software engineering, computer science, and how theoretical concepts apply to real systems, from algorithms and cryptography to AI and distributed systems. Also sharing notes from books and podcasts along the way.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.