• Home
  • Random
  • Recent changes
  • Special pages
  • Community portal
  • Preferences
  • About Wikipedia
  • Disclaimers
Incubator escapee wiki
  • Talk
  • Dark mode
  • Contributions
  • Create account
  • Log in

Category:Graph algorithms

Category Discussion
  • Language
  • Watch
  • History
  • Edit
    • Page information
    • Permanent link
    • What links here

Template:Sister project Template:Cat main section

Graph algorithms solve problems related to graph theory. Template:CatAutoTOC

Template:AnchorPages in category "Graph algorithms"

The following 33 pages are in this category, out of 33 total.

A

  • A* search algorithm
  • Alpha–beta pruning

B

  • Belief propagation
  • Bellman–Ford algorithm
  • Borůvka's algorithm
  • Bottleneck traveling salesman problem
  • Breadth-first search

C

  • Centrality
  • Cuthill–McKee algorithm

D

  • Depth-first search
  • Dijkstra's algorithm
  • Dynamic link matching

E

  • Edmonds–Karp algorithm

F

  • Floyd–Warshall algorithm
  • Force-directed graph drawing
  • Ford–Fulkerson algorithm

G

  • Graph isomorphism
  • Graph reduction

I

  • Iterative deepening depth-first search

J

  • Johnson's algorithm

K

  • Knight's tour
  • Kruskal's algorithm

M

  • Minimax

N

  • Nearest neighbour algorithm
  • Nonblocking minimal spanning switch

P

  • Prim's algorithm

S

  • Sethi–Ullman algorithm
  • Subgraph isomorphism problem

T

  • Tarjan's off-line lowest common ancestors algorithm
  • Topological sorting
  • Transitive closure
  • Travelling salesman problem
  • Tree traversal
Retrieved from "https://zalansite.site/mediawiki/index.php?title=Category:Graph_algorithms&oldid=414929"
Last edited on 20 October 2024, at 01:29
Incubator escapee wiki
  • This page was last edited on 20 October 2024, at 01:29.
  • Privacy policy
  • About Wikipedia
  • Disclaimers