🔢
Algorithms & Data
⌘
Ctrl
k
For the complete documentation index, see
llms.txt
. This page is also available as
Markdown
.
Copy
On this page
Overview
3. How to construct Algorithm? Paradigm
MST (Minimum Spanning Tree)
Prim vs Digkstra
Prim
Previous
MST (Minimum Spanning Tree)
Next
Prim, Kruskal Why? only undirected graph?
Last updated
7 months ago