Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Prim's algorithm · Vinony

EntityQ470813· pop 33· linked from 169 articles

Prim's algorithm

Sign in to save

algorithm for finding the minimum spanning tree for weighted undirected graphs

Connections

time complexity

Bellman–Ford algorithm

glossary of graph theory terms

computer science

International Standard Book Number

digital object identifier

Edsger W. Dijkstra

array data structure

Dijkstra's algorithm

depth-first search

breadth-first search

Categories

Graph algorithms Greedy algorithms Spanning tree

Sources

wikipedia.externallinksexternallink

What links here169 pages

Vojtěch Jarník

approximation algorithm

Dijkstra's algorithm

ant colony optimization algorithms

nonlinear programming

golden section search

convex optimization

Johnson's algorithm

Firefly algorithm

Broyden–Fletcher–Goldfarb–Shanno algorithm

integer programming

bidirectional search

Dinic's algorithm

register allocation

Newton's method in optimization

quadratic programming

Coordinate descent

breadth-first search

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

shortest path tree

Entitydist 0.36

Edmonds' algorithm

Entitydist 0.39

Johnson's algorithm

Entitydist 0.54

Entitydist 0.55

Entitydist 0.56

algebraic graph theory

Entitydist 0.57

geometric graph theory

Entitydist 0.57

Ukkonen's algorithm

Entitydist 0.58

ant colony optimization algorithms

Entitydist 0.59

branch-decomposition

Entitydist 0.59

Category:Graph algorithms

Entitydist 0.59

Category:Computational problems in graph theory

Entitydist 0.59