Thuật toán Prim
Sign in to saveAlso known as DJP algorithm, Jarník algorithm, Prim–Jarník algorithm, Prim–Dijkstra algorithm, Jarnik algorithm
algorithm for finding the minimum spanning tree for weighted undirected graphs
In the Vinony graph
Vinony's link graph records 169 inbound references to Thuật toán Prim, and connects out to time complexity, Bellman–Ford algorithm and glossary of graph theory terms.
Vinony files it under Graph algorithms, Greedy algorithms and Spanning tree.
Vinony links it to 32 Wikipedia language editions.
Wikidata facts
Show 1 more fact
- Commons category
- Prim's algorithm
Sources (2)
via Wikidata · CC0
Connections
time complexity
Entity
Bellman–Ford algorithm
Entity
glossary of graph theory terms
Entity
dense graph
Entity
computer science
Entity
International Standard Book Number
Entity
digital object identifier
Entity
Czechs
Entity
Edsger W. Dijkstra
Entity
graph theory
Entity
graph
Entity
bibcode
Entity
array data structure
Entity
Dijkstra's algorithm
Entity
pseudocode
Entity
linked list
Entity
heap
Entity
depth-first search
Entity
breadth-first search
Entity
big O notation
Entity