Top graph algorithms (Trending topics)

The following are the current most viewed articles on Wikipedia within Wikipedia's Graph algorithms category. Think of it as a What's Hot list for Graph algorithms. More info »

This is a beta release and so the figures may be a day or two out of date. We'd love to get your thoughts.

Rank Topic Wikipedia views
1 Dijkstra's algorithm 3,135
2 Travelling salesman problem 2,103
3 A* search algorithm 1,845
4 Tree traversal 1,740
5 Depth-first search 1,716
7 Minimax 1,163
8 Prim's algorithm 991
9 Kruskal's algorithm 881
10 Shortest path problem 813
11 Knight's tour 763
12 Floyd–Warshall algorithm 760
13 Bellman–Ford algorithm 728
14 Alpha-beta pruning 656
15 Topological sorting 616
16 Flow network 354
17 Graph isomorphism 313
18 Belief propagation 284
19 Ford–Fulkerson algorithm 281
20 Strongly connected component 241
21 Force-based algorithms (graph drawing) 212
22 D* 199
23 Johnson's algorithm 185
24 Tarjan's strongly connected components algorithm 184
25 Iterative deepening depth-first search 174
26 Uniform-cost search 172
27 Longest path problem 164
28 Graph traversal 155
29 Edmonds–Karp algorithm 113
30 Flooding algorithm 104
31 Subgraph isomorphism problem 102
32 Reverse-delete algorithm 99
33 Graph rewriting 98
34 Barabási–Albert model 96
35 B* 95
36 Graph isomorphism problem 93
37 Nearest neighbour algorithm 80
38 Hopcroft–Karp algorithm 75
39 Depth-limited search 71
40 Borůvka's algorithm 66
41 Bidirectional search 63
42 Edmonds's algorithm 63
43 Nonblocking minimal spanning switch 59
44 IDA* 59
45 Tarjan's off-line least common ancestors algorithm 56
46 Graph embedding 54
47 Dinic's algorithm 54
49 Push-relabel maximum flow algorithm 50
50 Gabow's algorithm 49
51 Junction tree algorithm 45
52 Kosaraju's algorithm 44
53 Planarity testing 40
54 Cuthill–McKee algorithm 39
55 Graph bandwidth 39
56 Graph reduction 37
57 Girvan–Newman algorithm 37
58 SMA* 37
59 Christofides algorithm 36
60 Bron–Kerbosch algorithm 36
61 Transitive reduction 31
62 Edmonds's matching algorithm 31
63 Bottleneck traveling salesman problem 29
64 Gomory–Hu tree 27
65 Color-coding 26
66 Aperiodic graph 25
67 Sethi–Ullman algorithm 24
68 Proof-number search 24
69 Hierarchical clustering of networks 20
70 Algorithmic version for Szemerédi regularity partition 18
71 Spectral layout 17
72 Closure problem 15
73 Fringe search 15
74 Grafting (algorithm) 14
75 Chaitin's algorithm 13
76 Karger's algorithm 13
77 Clique percolation method 13
78 Dulmage–Mendelsohn decomposition 12
79 Dijkstra-Scholten algorithm 12
80 William Lawrence Kocay 7
81 Goal node (computer science) less than 5 views
82 AF-heap less than 5 views

Encyclopedia

Graph algorithms solve problems related to graph theory.

Subcategories

This category has only the following subcategory.

Pages in category "Graph algorithms"

The following 78 pages are in this category, out of 78 total. This list may not reflect recent changes (learn more).