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

Home
Graph algorithms
پیمایش گراف

🌐فارسی

English Français Italiano Svenska Tiếng Việt Русский العربية فارسی हिन्दी 한국어 中文

پیمایش گراف

EntityQ907955· pop 11· linked from 130 articles

پیمایش گراف

Also known as graph search

checking and/or changing each vertex in a graph

Available in 11 languages

Français
中文
Русский
Hungarian
Serbian
Svenska
Tiếng Việt
Ukrainian
فارسی
한국어

Connections

Bellman–Ford algorithm

shortest path problem

Categories

Graph algorithms

Sources

wikipedia.externallinksexternallink
Wikidata (CC0)wikidata-claims
Pixabayimage-pixabay

via Wikidata sitelinks · CC0

topological sorting

Entity

computer science

digital object identifier

sorting algorithm

array data structure

Dijkstra's algorithm

binary search algorithm

Sign in to save

Similar entities

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

Entitydist 0.44

Hamiltonian path

Entitydist 0.49

biconnected graph

Entitydist 0.49

claw-free graph

Entitydist 0.49

Entitydist 0.49

Entitydist 0.50

feedback vertex set

Entitydist 0.51

Entitydist 0.51

Entitydist 0.52

vertex-transitive graph

Entitydist 0.53

graph connectivity measure

Entitydist 0.54

Entitydist 0.54

What links here130 pages

bidirectional search

greedy algorithm

Johnson's algorithm

Streaming algorithm

navigation mesh

online algorithm

Facebook Graph Search

Dijkstra's algorithm

breadth-first search

iterative deepening depth-first search

Simplified Memory-Bounded A*

brute-force search

evaluation function

graph data structure