Thuật toán Kruskal
Sign in to saveminimum spanning forest algorithm that greedily adds edges
In the Vinony graph
Within Vinony's link graph, Thuật toán Kruskal is referenced by 165 other articles, and connects out to Bellman–Ford algorithm, Ackermann function and International Standard Book Number.
Vinony files it under Graph algorithms, Greedy algorithms and Spanning tree.
Its subject is documented across 30 Wikipedia language editions.
Key facts
- Class
- Minimum spanning tree algorithm
- Data structure
- Graph
- Worst case performance
- O ( | E | log | V | ) {\displaystyle O(|E|\log |V|)}
via Wikipedia infobox
Wikidata facts
- Named after
- Joseph Kruskal
- Image
- MST kruskal en.gif
Show 6 more facts
- Commons category
- Kruskal's algorithm
- Stack Exchange tag
- stackoverflow.com/tags/kruskals-algorithm
- publication date
- 1956-00-00
- discoverer or inventor
- Joseph Kruskal
- computes solution to
- minimum spanning tree
Sources (2)
via Wikidata · CC0
Connections
Bellman–Ford algorithm
Entity
Ackermann function
Entity
International Standard Book Number
Entity
digital object identifier
Entity
mathematical induction
Entity
OCLC, Inc.
Entity
JSTOR
Organization
quicksort
Entity
Dijkstra's algorithm
Entity
pseudocode
Entity
depth-first search
Entity
breadth-first search
Entity
complete graph
Entity
Semantic Scholar
Entity
Ron Rivest
Entity
greedy algorithm
Entity
Prim's algorithm
Entity
minimum spanning tree
Entity
A* search algorithm
Entity
radix sort
Entity