Also known as DJP algorithm, Jarník algorithm, Prim–Jarník algorithm, Prim–Dijkstra algorithm, Jarnik algorithm
algorithm for finding the minimum spanning tree for weighted undirected graphs
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).
via Wikidata sitelinks · CC0