Prim's algorithm

algorithm for finding the minimum spanning tree for weighted undirected graphs
rdfs:label
"Prim's algorithm"@en
skos:altLabel
"DJP algorithm"@en
"Jarnik algorithm"@en
"Jarník algorithm"@en
"Prim–Dijkstra algorithm"@en
"Prim–Jarník algorithm"@en
schema:description
"algorithm for finding the minimum spanning tree for weighted undirected graphs"@en
schema:dateModified "2026-11-14T01:42:37+00:00"^^xsd:dateTime
schema:version 2568971530
wikibase:identifiers 6
wikibase:sitelinks 33
wikibase:statements 20
p:P10283 wd:statement/Q470813-980218ED-7451-409E-ADC6-46D5C89A8375
p:P138 wd:statement/Q470813-63fee8e4-4a66-1fa9-0d69-ef129deae42f
wd:statement/q470813-0c7e4be9-4dac-102e-747f-77521e651765
p:P31 wd:statement/Q470813-45B60198-F8F9-4F13-8839-196F2C087778
wd:statement/Q470813-685038ab-45de-40b7-d862-2c2dab29782c
wd:statement/Q470813-c9d3019c-4186-6b95-1d41-3aa09ec8b220
p:P366 wd:statement/Q470813-0c5beb7b-46da-723f-07d8-b83e43c65af8
wd:statement/Q470813-8af4a754-4453-0aca-becc-44424f94c1e4
p:P373 wd:statement/q470813-B5E58FBD-9BAA-4D28-B2A9-9529657455AB
p:P3752 wd:statement/Q470813-04399989-4d16-06cd-85d8-e6039344e08f
wd:statement/Q470813-8851bb87-45f5-5788-b417-45d0050f01b6
wd:statement/Q470813-b18f563d-4bdb-0e21-4fd2-7487694c4910
p:P5106 wd:statement/Q470813-2EE83E28-0A0E-419C-AB23-A0EFB45740AC
wd:statement/Q470813-74DCE8B0-7580-4F27-94FB-D5AA008F265D
wd:statement/Q470813-82829049-E738-4BC1-9F3C-6BB5D4C2B77F
p:P61 wd:statement/Q470813-049a3d57-4f16-fa44-708e-299fd397943c
wd:statement/Q470813-8964ad76-416c-bf67-e210-61bb07835529
wd:statement/Q470813-bef42e6c-4938-7839-1a8d-2d8ca0a1be6c
p:P6366 wd:statement/Q470813-027ECC5C-92C7-46ED-987F-884A07BF715B
p:P646 wd:statement/Q470813-F964007B-20E6-4B05-8660-B6F395FC10C5
p:direct-normalized/P6366 <https://makg.org/entity/1649724>
wdt:P10283 "C1649724"
wdt:P138 Vojtěch Jarník
Robert C. Prim
wdt:P31 graph algorithm
greedy algorithm
algorithm
wdt:P366 minimum spanning tree
decision tree
wdt:P373 "Prim's algorithm"
wdt:P3752 "<math class="mwe-math-element mwe-math-element-inline" xmlns="http://www.w3.org/1998/Math/MathML"><mrow data-mjx-texclass="ORD"><mstyle displaystyle="true" scriptlevel="0"><mi>O</mi><mo stretchy="false">(</mo><mo stretchy="false">(</mo><mo stretchy="false">|</mo><mi>V</mi><mo stretchy="false">|</mo><mo stretchy="false">+</mo><mo stretchy="false">|</mo><mi>E</mi><mo stretchy="false">|</mo><mo stretchy="false">)</mo><mi>log</mi><mo>&#x2061;</mo><mo stretchy="false">|</mo><mi>V</mi><mo stretchy="false">|</mo><mo stretchy="false">)</mo><mo stretchy="false">=</mo><mi>O</mi><mo stretchy="false">(</mo><mo stretchy="false">|</mo><mi>E</mi><mo stretchy="false">|</mo><mi>log</mi><mo>&#x2061;</mo><mo stretchy="false">|</mo><mi>V</mi><mo stretchy="false">|</mo><mo stretchy="false">)</mo></mstyle></mrow></math>"^^http://www.w3.org/1998/Math/MathML
"<math class="mwe-math-element mwe-math-element-inline" xmlns="http://www.w3.org/1998/Math/MathML"><mrow data-mjx-texclass="ORD"><mstyle displaystyle="true" scriptlevel="0"><mi>O</mi><mo stretchy="false">(</mo><mo stretchy="false">|</mo><mi>E</mi><mo stretchy="false">|</mo><mo stretchy="false">+</mo><mo stretchy="false">|</mo><mi>V</mi><mo stretchy="false">|</mo><mi>log</mi><mo>&#x2061;</mo><mo stretchy="false">|</mo><mi>V</mi><mo stretchy="false">|</mo><mo stretchy="false">)</mo></mstyle></mrow></math>"^^http://www.w3.org/1998/Math/MathML
"<math class="mwe-math-element mwe-math-element-inline" xmlns="http://www.w3.org/1998/Math/MathML"><mrow data-mjx-texclass="ORD"><mstyle displaystyle="true" scriptlevel="0"><mi>O</mi><mo stretchy="false">(</mo><mo stretchy="false">|</mo><mi>V</mi><msup><mo stretchy="false">|</mo><mrow data-mjx-texclass="ORD"><mn>2</mn></mrow></msup><mo stretchy="false">)</mo></mstyle></mrow></math>"^^http://www.w3.org/1998/Math/MathML
wdt:P5106 "PrimJarniacutek"
"PrimsAlgorithm"
"primJarnik"
wdt:P61 Vojtěch Jarník
Edsger W. Dijkstra
Robert C. Prim
wdt:P6366 "1649724"
wdt:P646 "/m/0f2jn"
Download as:
TurtleJSON-LDRDF/XML
data from SPARQL profile: Wikidata