---
title: "Discussion on \"[CS fundamentals] Greedy - Dijkstra, Kruskal and Prim's Algorithm\" | Hashnode"
description: "Discussion on \"[CS fundamentals] Greedy - Dijkstra, Kruskal and Prim's Algorithm\". Think about how Google Maps finds the shortest path from your home to your favorite restaurant. Each traffic light might represent a vertex of a graph"
url: "https://hashnode.com/posts/cs-fundamentals-greedy-dijkstra-kruskal-and-prim-s-algorithm/6a60dee33bf038f7b9a8f2af"
---

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

Discussion

# [\[CS fundamentals\] Greedy - Dijkstra, Kruskal and Prim's Algorithm](https://jaylog.hashnode.dev/cs-fundamentals-greedy-dijkstra-kruskal-and-prim-s-algorithm?utm_source=hashnode&utm_medium=feed)

Think about how Google Maps finds the shortest path from your home to your favorite restaurant. Each traffic light might represent a vertex of a graph

Jul 22 · 6 min read · jaylog.hashnode.dev  
Read the article

-   [#dsa](https://hashnode.com/tag/dsa)
-   [#data-structures](https://hashnode.com/tag/data-structures)
-   [#dijkstra](https://hashnode.com/tag/dijkstra)
-   [#greedy](https://hashnode.com/tag/greedy)
-   [#algorithm](https://hashnode.com/tag/algorithm)

## Written by

[Lim Woojae](https://hashnode.com/@jaylog)

@jaylog · Sydney

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

Computer Science @UNSW

## Responses

Markdown supported · ⌘↵ to post

No responses yet.