Wikimedia neighborhood · Wikidata observation Observed Graph-projection

Prim's algorithm

algorithm for finding the minimum spanning tree for weighted undirected graphs

Provider: Wikidata. These recorded connections are observations, not Counterpedia claims. They do not establish source support.

Data and provenance

Provider: Wikidata · Entity ID: Q470813

Release: sha256:f33228901a35b0683356002a46df9ceb11f399d05f17abb5c7c78256cbf38ba7

Graph membership is not truth. Each relation below is an observed typed edge the local Wikimedia graph bundle already materialized — not a corroborated, verified, or admitted claim. Bounded to 40 relations via an offset-index lookup (offset_index_binary_search), never a full scan of the bundle.Serving a published subset: joined entities + 1-hop neighborhood of 35,994 exact Wikipedia–Wikidata title matches. A subject that is not itself in that subset carries only the relations the subset recorded for it, so a small count here is the published scope and not a complete relationship inventory.

Development requests are not available on this deployment. The observed entity and its graph links remain readable.

1-hop relations (15)

Observed adjacency only. Each spoke is a typed edge already materialized in the graph, labeled by its recorded predicate — graph proximity is not support, corroboration, or admission. The links below are the accessible, no-JavaScript path to the same neighbors.

Follow a connection

Grouped by a fixed presentation taxonomy for legibility only. The grouping asserts no rank, truth, support, or standing — every observed edge is carried, none reordered by importance.

Identity & relations (3)

→ instance of (P31)greedy algorithmObserved
Relationship details
Provider: Wikidata · Property: P31 · Direction: outgoing · Entity ID: Q504353
→ instance of (P31)graph algorithmObserved
Relationship details
Provider: Wikidata · Property: P31 · Direction: outgoing · Entity ID: Q30503704
→ instance of (P31)algorithmObserved
Relationship details
Provider: Wikidata · Property: P31 · Direction: outgoing · Entity ID: Q8366

Notable works (1)

← notable work (P800)Vojtěch JarníkObserved
Relationship details
Provider: Wikidata · Property: P800 · Direction: incoming · Entity ID: Q730209

Other connections (10)

→ Relationship name unavailable (P3752)O(|E| + |V| \log |V|)Observed
Relationship details
Provider: Wikidata · Property: P3752 · Direction: outgoing
→ Relationship name unavailable (P3752)O(|V|^2)Observed
Relationship details
Provider: Wikidata · Property: P3752 · Direction: outgoing
→ Relationship name unavailable (P366)decision treeObserved
Relationship details
Provider: Wikidata · Property: P366 · Direction: outgoing · Entity ID: Q831366
→ Relationship name unavailable (P61)Edsger W. DijkstraObserved
Relationship details
Provider: Wikidata · Property: P61 · Direction: outgoing · Entity ID: Q8556
→ Relationship name unavailable (P366)minimum spanning treeObserved
Relationship details
Provider: Wikidata · Property: P366 · Direction: outgoing · Entity ID: Q240464
→ Relationship name unavailable (P61)Robert C. PrimObserved
Relationship details
Provider: Wikidata · Property: P61 · Direction: outgoing · Entity ID: Q92939
→ named after (P138)Robert C. PrimObserved
Relationship details
Provider: Wikidata · Property: P138 · Direction: outgoing · Entity ID: Q92939
→ Relationship name unavailable (P3752)O((|V| + |E|) \log |V|) = O(|E| \log |V|)Observed
Relationship details
Provider: Wikidata · Property: P3752 · Direction: outgoing
→ Relationship name unavailable (P61)Vojtěch JarníkObserved
Relationship details
Provider: Wikidata · Property: P61 · Direction: outgoing · Entity ID: Q730209
→ named after (P138)Vojtěch JarníkObserved
Relationship details
Provider: Wikidata · Property: P138 · Direction: outgoing · Entity ID: Q730209

External identifiers (1)

→ Commons category (P373)Prim's algorithmObserved
Relationship details
Provider: Wikidata · Property: P373 · Direction: outgoing

Return to entry