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.

graph traversal · Vinony

graph traversal

EntityQ907955· pop 11· linked from 130 articles

graph traversal

Sign in to save

checking and/or changing each vertex in a graph

Wikidata facts

Subclass of: search algorithm

Show 1 more fact

P2283: graph

via Wikidata · CC0

Connections

Bellman–Ford algorithm

shortest path problem

Categories

Graph algorithms

Sources

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

topological sorting

Entity

computer science

digital object identifier

sorting algorithm

array data structure

Dijkstra's algorithm

binary search algorithm

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

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