The following pages link to Prim's algorithm
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Algorithm (links | edit)
- Heap (data structure) (links | edit)
- Iterative method (links | edit)
- List of algorithms (links | edit)
- Newton's method (links | edit)
- Priority queue (links | edit)
- Search algorithm (links | edit)
- Tree (abstract data type) (links | edit)
- Quadratic programming (links | edit)
- Minimum spanning tree (links | edit)
- Shortest path problem (links | edit)
- Linear programming (links | edit)
- Dijkstra's algorithm (links | edit)
- Mathematical optimization (links | edit)
- Kruskal's algorithm (links | edit)
- Greedy algorithm (links | edit)
- Breadth-first search (links | edit)
- Depth-first search (links | edit)
- A* search algorithm (links | edit)
- Dynamic programming (links | edit)
- Best-first search (links | edit)
- Alpha–beta pruning (links | edit)
- Borůvka's algorithm (links | edit)
- Maze generation algorithm (links | edit)
- Gradient descent (links | edit)
- Bellman–Ford algorithm (links | edit)
- Floyd–Warshall algorithm (links | edit)
- Edmonds–Karp algorithm (links | edit)
- Fibonacci heap (links | edit)
- List of mathematical proofs (links | edit)
- 1957 in science (links | edit)
- Simplex algorithm (links | edit)
- List of graph theory topics (links | edit)
- Hill climbing (links | edit)
- Tabu search (links | edit)
- 1959 in science (links | edit)
- Integer programming (links | edit)
- Timeline of algorithms (links | edit)
- Combinatorial optimization (links | edit)
- Discrete optimization (links | edit)
- Iterative deepening depth-first search (links | edit)
- Branch and bound (links | edit)
- Register allocation (links | edit)
- Approximation algorithm (links | edit)
- 1930 in science (links | edit)
- Ant colony optimization algorithms (links | edit)
- Tree traversal (links | edit)
- Greedoid (links | edit)
- Nonlinear programming (links | edit)
- Jarnik algorithm (redirect page) (links | edit)