Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Prim's_algorithm> ?p ?o }
Showing triples 1 to 54 of
54
with 100 triples per page.
- Prim's_algorithm abstract "In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník and later independently by computer scientist Robert C. Prim in 1957 and rediscovered by Edsger Dijkstra in 1959. Therefore it is also sometimes called the DJP algorithm, the Jarník algorithm, or the Prim–Jarník algorithm.Other algorithms for this problem include Kruskal's algorithm and Borůvka's algorithm. These algorithms find the minimum spanning forest in a possibly disconnected graph. By running Prim's algorithm for each connected component of the graph, it can also be used to find the minimum spanning forest.".
- Prim's_algorithm thumbnail Prim's_algorithm.svg?width=300.
- Prim's_algorithm wikiPageExternalLink annas.
- Prim's_algorithm wikiPageExternalLink ngenerics.
- Prim's_algorithm wikiPageExternalLink programs.html.
- Prim's_algorithm wikiPageExternalLink prim's-algorithm.
- Prim's_algorithm wikiPageExternalLink prim.htm.
- Prim's_algorithm wikiPageExternalLink mgraphlib.
- Prim's_algorithm wikiPageID "53783".
- Prim's_algorithm wikiPageRevisionID "605967594".
- Prim's_algorithm hasPhotoCollection Prim's_algorithm.
- Prim's_algorithm subject Category:Articles_containing_proofs.
- Prim's_algorithm subject Category:Graph_algorithms.
- Prim's_algorithm subject Category:Spanning_tree.
- Prim's_algorithm type Abstraction100002137.
- Prim's_algorithm type Act100030358.
- Prim's_algorithm type Activity100407535.
- Prim's_algorithm type Algorithm105847438.
- Prim's_algorithm type Event100029378.
- Prim's_algorithm type GraphAlgorithms.
- Prim's_algorithm type Procedure101023820.
- Prim's_algorithm type PsychologicalFeature100023100.
- Prim's_algorithm type Rule105846932.
- Prim's_algorithm type YagoPermanentlyLocatedEntity.
- Prim's_algorithm comment "In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník and later independently by computer scientist Robert C. Prim in 1957 and rediscovered by Edsger Dijkstra in 1959.".
- Prim's_algorithm label "Algorithme de Prim".
- Prim's_algorithm label "Algorithmus von Prim".
- Prim's_algorithm label "Algoritme van Prim".
- Prim's_algorithm label "Algoritmo de Prim".
- Prim's_algorithm label "Algoritmo de Prim".
- Prim's_algorithm label "Algoritmo di Prim".
- Prim's_algorithm label "Algorytm Prima".
- Prim's_algorithm label "Prim's algorithm".
- Prim's_algorithm label "Алгоритм Прима".
- Prim's_algorithm label "プリム法".
- Prim's_algorithm label "普林姆算法".
- Prim's_algorithm sameAs Jarníkův_algoritmus.
- Prim's_algorithm sameAs Algorithmus_von_Prim.
- Prim's_algorithm sameAs Algoritmo_de_Prim.
- Prim's_algorithm sameAs Algorithme_de_Prim.
- Prim's_algorithm sameAs Algoritma_Prim.
- Prim's_algorithm sameAs Algoritmo_di_Prim.
- Prim's_algorithm sameAs プリム法.
- Prim's_algorithm sameAs 프림_알고리즘.
- Prim's_algorithm sameAs Algoritme_van_Prim.
- Prim's_algorithm sameAs Algorytm_Prima.
- Prim's_algorithm sameAs Algoritmo_de_Prim.
- Prim's_algorithm sameAs m.0f2jn.
- Prim's_algorithm sameAs Q470813.
- Prim's_algorithm sameAs Q470813.
- Prim's_algorithm sameAs Prim's_algorithm.
- Prim's_algorithm wasDerivedFrom Prim's_algorithm?oldid=605967594.
- Prim's_algorithm depiction Prim's_algorithm.svg.
- Prim's_algorithm isPrimaryTopicOf Prim's_algorithm.