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.

الگوریتم *B · Vinony

Home
Combinatorial optimization
الگوریتم *B

🌐فارسی

English Русский فارسی

EntityQ4833637· pop 5· linked from 37 articles

الگوریتم *B

بی استار

Available in 5 languages

Русский
Hungarian
Serbian
فارسی

via Wikidata sitelinks · CC0

Connections

Bellman–Ford algorithm

graph traversal

Categories

Combinatorial optimization Game artificial intelligence Graph algorithms Routing algorithms Search algorithms

Sources

wikipedia.externallinksexternallink

computer science

Entity

International Standard Book Number

digital object identifier

Dijkstra's algorithm

depth-first search

breadth-first search

Prim's algorithm

minimum spanning tree

A* search algorithm

Kruskal's algorithm

Floyd–Warshall algorithm

shortest path problem

list of algorithms

alpha–beta pruning

Sign in to save

What links here37 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

Reverse-delete algorithm

Similar entities

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

A* search algorithm

Entitydist 0.29

jump point search

Entitydist 0.54

Entitydist 0.56

Entitydist 0.56

exponential backoff

Entitydist 0.63

Entitydist 0.65

particle swarm optimization

Entitydist 0.66

Entitydist 0.67

Companydist 0.67

Entitydist 0.67

Entitydist 0.68

Entitydist 0.69