algorithme de Kruskal
Sign in to savealgorithme de recherche d’arbre recouvrant de poids minimum dans un graph connexe non-orienté
In the Vinony graph
Vinony's link graph records 165 inbound references to algorithme de Kruskal, and connects out to Bellman–Ford algorithm, Ackermann function and International Standard Book Number.
It is catalogued under topics including Graph algorithms, Greedy algorithms and Spanning tree.
Vinony links it to 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
Article · Français
En informatique, l'algorithme de Kruskal est un algorithme de recherche d'arbre recouvrant de poids minimum (ARPM) ou arbre couvrant minimum (ACM) dans un graphe connexe non-orienté et pondéré. Il a été conçu en 1956 par Joseph Kruskal.
Abstract from DBpedia / Wikipedia · CC BY-SA
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