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.

Kruskal's algorithm · Vinony

EntityQ797860· pop 31· linked from 165 articles

Kruskal's algorithm

Sign in to save

minimum spanning forest algorithm that greedily adds edges

Connections

Bellman–Ford algorithm

Ackermann function

International Standard Book Number

digital object identifier

mathematical induction

Dijkstra's algorithm

depth-first search

breadth-first search

greedy algorithm

Prim's algorithm

minimum spanning tree

A* search algorithm

Categories

Graph algorithms Greedy algorithms Spanning tree

Sources

wikipedia.externallinksexternallink

What links here165 pages

alpha–beta pruning

ellipsoid method

Steiner tree problem

approximation algorithm

golden section search

nonlinear programming

Broyden–Fletcher–Goldfarb–Shanno algorithm

Dijkstra's algorithm

Johnson's algorithm

convex optimization

Firefly algorithm

ant colony optimization algorithms

integer programming

bidirectional search

Dinic's algorithm

register allocation

connected component of a graph

Newton's method in optimization

Similar entities

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

Dijkstra's algorithm

Entitydist 0.50

Entitydist 0.55

Entitydist 0.56

uniform-cost search

Entitydist 0.56

blossom algorithm

Entitydist 0.58

Entitydist 0.59

double-star snark

Entitydist 0.59

Category:Extremal graph theory

Entitydist 0.59

extremal graph theory

Entitydist 0.59

Entitydist 0.59

Entitydist 0.59

Frank–Wolfe algorithm

Entitydist 0.59