• Home
  • Random
  • Nearby
  • Log in
  • Settings
Donate Now If Wikipedia is useful to you, please give today.
  • About Wikipedia
  • Disclaimers
Wikipedia

Template:Graph traversal algorithms

  • Template
  • Talk
  • Language
  • Watch
  • Edit
  • v
  • t
  • e
Graph and tree traversal algorithms
Search
  • α–β pruning
  • A*
    • IDA*
    • LPA*
    • SMA*
  • Best-first search
  • Beam search
  • Bidirectional search
  • Breadth-first search
    • Lexicographic
    • Parallel
  • B*
  • Depth-first search
    • Iterative deepening
  • D*
  • Fringe search
  • Jump point search
  • Monte Carlo tree search
  • SSS*
Shortest path
  • Bellman–Ford
  • Dijkstra's
  • Floyd–Warshall
  • Johnson's
  • Shortest path faster
  • Yen's
Minimum spanning tree
  • Borůvka's
  • Kruskal's
  • Prim's
  • Reverse-delete
List of graph search algorithms

No description.

Template parameters[Edit template data]

ParameterDescriptionTypeStatus
statestate

controls when a navbox is expanded or collapsed

Suggested values
autocollapse collapsed expanded plain off
Default
autocollapse
Stringoptional
Retrieved from "https://en.wikipedia.org/w/index.php?title=Template:Graph_traversal_algorithms&oldid=1223088490"