Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

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

الگوریتم حذف معکوس · Vinony

🌐فارسی

English Français Русский فارسی ไทย 日本語

EntityQ4925151· pop 7· linked from 36 articles

الگوریتم حذف معکوس

minimum spanning forest algorithm that greedily deletes edges

Available in 7 languages

Français
日本語
Русский
Serbian
فارسی
ไทย

via Wikidata sitelinks · CC0

Connections

Bellman–Ford algorithm

Categories

Graph algorithms Spanning tree

Sources

wikipedia.externallinksexternallink

digital object identifier

Entity

Dijkstra's algorithm

depth-first search

breadth-first search

greedy algorithm

Prim's algorithm

A* search algorithm

minimum spanning tree

Kruskal's algorithm

Floyd–Warshall algorithm

list of algorithms

shortest path problem

alpha–beta pruning

Sign in to save

Similar entities

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

Entitydist 0.62

Category:Candidates for speedy deletion as duplicate articles

Entitydist 0.65

Entitydist 0.69

Baum–Welch algorithm

Entitydist 0.70

British Museum algorithm

Entitydist 0.70

selection algorithm

Entitydist 0.70

Category:Binary trees

Entitydist 0.72

exponential search

Entitydist 0.74

undecidable problem

Entitydist 0.74

Category:Deep Forest albums

Entitydist 0.74

Category:Wikipedia deletion policies

Entitydist 0.75

Entitydist 0.75

What links here36 pages

alpha–beta pruning

Floyd–Warshall algorithm

Dijkstra's algorithm

Johnson's algorithm

bidirectional search

breadth-first search

iterative deepening depth-first search

Simplified Memory-Bounded A*

graph traversal

depth-first search

jump point search

Bellman–Ford algorithm

Monte Carlo tree search

Edmonds' algorithm

Borůvka's algorithm

iterative deepening A*

A* search algorithm

best-first search