---
title: "Discussion on \"Finding the shortest path with topological sort in Directed Acyclic Graph\" | Hashnode"
description: "Discussion on \"Finding the shortest path with topological sort in Directed Acyclic Graph\". Introduction\nIn a directed acyclic graph (DAG), a topological sort is a linear ordering of the vertices such that for every directed edge, the vertex u comes before v in the ordering. This ordering can be used to find the shortest path between two ve..."
url: "https://hashnode.com/posts/finding-the-shortest-path-with-topological-sort-in-directed-acyclic-graph/64564050d5451f391079ea45"
---

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

Discussion

# [Finding the shortest path with topological sort in Directed Acyclic Graph](https://blog.khandokeranan.com/finding-the-shortest-path-with-topological-sort-in-directed-acyclic-graph?utm_source=hashnode&utm_medium=feed)

Introduction In a directed acyclic graph (DAG), a topological sort is a linear ordering of the vertices such that for every directed edge, the vertex u comes before v in the ordering. This ordering can be used to find the shortest path between two ve...

May 6, 2023 · 6 min read · blog.khandokeranan.com  
Read the article

-   [#dfs](https://hashnode.com/tag/dfs)
-   [#graph](https://hashnode.com/tag/graph)
-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#shortestpath](https://hashnode.com/tag/shortestpath)
-   [#topological-sort](https://hashnode.com/tag/topological-sort)

## Written by

[khandoker anan](https://hashnode.com/@khandokeranan)

@khandokeranan

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

Exploring the frontiers of technology: From coding to innovation and beyond.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.