---
title: "Discussion on \"\t\nDjisktra's Algorithm\" | Hashnode"
description: "Discussion on \"\t\nDjisktra's Algorithm\". Problem\nGiven an undirected, weighted graph with V vertices numbered from 0 to V-1 and E edges, represented by 2d array edges[][], where edges[i]=[u, v, w] represents the edge between the nodes u and"
url: "https://hashnode.com/posts/dijkstra-algorithm/68c6576f78daf3159fa658b7"
---

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

Discussion

# [Djisktra's Algorithm](https://chetan77.hashnode.dev/dijkstra-algorithm?utm_source=hashnode&utm_medium=feed)

Problem Given an undirected, weighted graph with V vertices numbered from 0 to V-1 and E edges, represented by 2d array edges\[\]\[\], where edges\[i\]=\[u, v, w\] represents the edge between the nodes u and

Sep 14, 2025 · 6 min read · chetan77.hashnode.dev  
Updated Jun 29  
Read the article

-   [#dijkstra-algorithm](https://hashnode.com/tag/dijkstra-algorithm)
-   [#min-heap](https://hashnode.com/tag/min-heap)
-   [#dsa](https://hashnode.com/tag/dsa)
-   [#graphs](https://hashnode.com/tag/graphs)
-   [#leetcode](https://hashnode.com/tag/leetcode)

## Written by

[Chetan Datta](https://hashnode.com/@chetan77)

@chetan77 · Hyderabad, India

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

Software Engineer

I share my learnings here. Thanks for reading.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
