Movatterモバイル変換

Jump to content

Category:Graph algorithms

From Wikimedia Commons, the free media repository

<nowiki>algoritmo sui grafi; algorithme de la théorie des graphes; алгоритм на графах; graphentheoretischer Algorithmus; algoritmo de grafos; գրաֆների ալգորիթմ; 图算法; algoritem teorije grafov; gráfalgoritmus; grafový algoritmus; grafalgoritm; grafalgoritme; אלגוריתם בתורת הגרפים; 圖論演算法; 圖論演算法; grafa algoritmo; algoritmo de grafo; graafialgoritmi; graph algorithm; خوارزمية مخصصة لبيان; 图算法; алгоритм на графах; 應用於圖論的演算法; tipo de algoritmo en la teoría de grafos; type of algorithm; класс комбинаторных алгоритмов; кляса комбінаторних алгоритмів; 應用於圖論的演算法; алгоритм в теории графов; gráfelméleti algoritmus; verkkoalgoritmi; algorithm in graph theory; Algorithmus in der Graphentheorie; grafové algoritmy; אלגוריתם על גרף</nowiki>

graph algorithm

type of algorithm

Upload media

Subclass of

combinatorial algorithm

Part of

graph theory

Authority file
Q30503704 NL CR AUT ID:ph770865
Reasonator Scholia Wikidocumentaries PetScan statistics WikiMap Locator tool KML file Search depicted

Edit infobox data on Wikidata

English:Graph algorithms solve problems related tograph theory.

Subcategories

This category has the following 15 subcategories, out of 15 total.

B

D

Depth-first search(1 P, 51 F)

F

Flow networks(4 C, 201 F)
Ford-Fulkerson's algorithm(1 C, 47 F)

H

Hierholzer's algorithm(11 F)

I

Graph isomorphism(23 F)

L

Line graph construction(10 F)

M

Minimum spanning trees(1 C, 21 F)

S

Schulze method(1 P, 135 F)
Shortest paths algorithms(5 C, 1 P, 22 F)

T

Thermal profiling graphs(14 F)

V

Videos of graph algorithms(1 F)

W

Weisfeiler Leman graph isomorphism test(15 F)

Media in category "Graph algorithms"

The following 200 files are in this category, out of 305 total.

(previous page) (next page)

10 repetitions of Karger’s contraction procedure.svg765 × 990; 3.11 MB
15-node network containing a combination of bi-directional and uni-directional links.png515 × 313; 40 KB
6 centrality measures.png600 × 900; 378 KB
AB pruning annotated.svg1,212 × 615; 61 KB
AB pruning.svg1,212 × 615; 43 KB
Algorithm Tarjan.png544 × 432; 7 KB
Algorithme de johnson 1.svg163 × 146; 20 KB
Algorithme de johnson 3.svg228 × 166; 32 KB
Algorithme de johnson étape 4.jpg500 × 448; 31 KB
Algorithme de Johnson.svg747 × 297; 20 KB
Algorithme de kosaraju exemple.svg256 × 155; 21 KB
Alpha-beta cuts.png644 × 308; 10 KB
Anchor Modeling Example.svg1,449 × 763; 41 KB
AntColony.gif860 × 321; 288 KB
Astar progress animation.gif210 × 210; 50 KB
AStar.gif346 × 352; 41 KB
Augmenting path.png812 × 593; 14 KB
Barabasi Albert generated network.jpg360 × 210; 7 KB
Beispiel Ungarische Methode.svg512 × 461; 16 KB
BFS-Algorithm Search Way zh-hans.gif480 × 360; 212 KB
BFS-Algorithm Search Way zh-hant.gif480 × 360; 440 KB
BFS-Algorithm Search Way.gif480 × 360; 660 KB
Blossom contraction.png836 × 578; 36 KB
Blossom contraction.svg512 × 381; 153 KB
Blossom end point path lifting.png875 × 484; 26 KB
Boruvka Step 1.svg618 × 518; 18 KB
Boruvka Step 2.svg744 × 600; 18 KB
Boruvka Step 3.svg744 × 600; 15 KB
Boruvka Step 4.svg744 × 600; 13 KB
Boruvka Step 5.svg744 × 600; 11 KB
Breadth first search tree.jpg840 × 518; 133 KB
Breadth search tree.jpg840 × 518; 133 KB
Brute force Clique algorithm.svg546 × 540; 115 KB
Camerini Algorithm 1.svg618 × 518; 18 KB
Camerini Algorithm 2.svg618 × 518; 14 KB
Camerini Algorithm 3.svg1,380 × 470; 22 KB
Camerini Algorithm 4.svg1,379 × 468; 21 KB
Can 73 cm.pdf785 × 820; 19 KB
Can 73 cm.svg471 × 493; 147 KB
Can 73 rcm.pdf785 × 820; 19 KB
Can 73 rcm.svg471 × 493; 147 KB
Centrality.svg600 × 900; 476 KB
Christofides Matching.svg390 × 390; 3 KB
Christofides MST.svg390 × 390; 3 KB
Component amirali.jpeg734 × 461; 20 KB
Component amiralii.jpeg695 × 507; 19 KB
Contraction vertices.jpg632 × 354; 16 KB
ContractionHierarchies1.png547 × 291; 9 KB
ContractionHierarchies2.png531 × 290; 10 KB
ContractionHierarchies3.png437 × 285; 6 KB
ContractionHierarchies4.png543 × 378; 10 KB
CPT-Graphs-directed-unweighted-ex1.svg381 × 350; 16 KB
CPT-Graphs-directed-unweighted.svg365 × 466; 21 KB
CPT-Graphs-directed-weighted-ex1.svg670 × 600; 1 KB
CPT-Graphs-directed-weighted-ex2.svg365 × 333; 20 KB
CPT-Graphs-directed-weighted.svg365 × 466; 28 KB
CPT-Graphs-undirected-unweighted-ex1.svg269 × 251; 7 KB
CPT-Graphs-undirected-unweighted-loop-multiedge.svg324 × 301; 11 KB
CPT-Graphs-undirected-unweighted-noloop-nomultiedge.svg324 × 301; 11 KB
CPT-Graphs-undirected-unweighted.svg365 × 466; 14 KB
CPT-Graphs-undirected-weighted-loop-multiedge.svg324 × 301; 14 KB
CPT-Graphs-undirected-weighted.svg365 × 466; 19 KB
Critical path algorithm.svg330 × 179; 48 KB
Cross blossom path lifting.png941 × 410; 32 KB
Cut and minimum spanning tree of a graph.svg890 × 655; 14 KB
CycleFindingNew.png235 × 263; 16 KB
Decade this far wealth vs internet growth.png800 × 600; 33 KB
Deletion-contraction.svg443 × 328; 21 KB
DFS finding cycle.gif1,030 × 660; 68 KB
Dijkstra algorithm example 2.svg750 × 500; 39 KB
Dijkstra algorithm example 3.svg750 × 500; 41 KB
Dijkstra algorithm example 5.svg470 × 370; 22 KB
Dijkstra.gif496 × 372; 474 KB
DijkstraDemo.gif521 × 518; 5.94 MB
Dijkstrapaso6.jpg497 × 253; 17 KB
Dijkstras progress animation.gif210 × 210; 128 KB
Dinic algorithm G1.svg1,311 × 567; 7 KB
Dinic algorithm G2.svg1,311 × 567; 7 KB
Dinic algorithm G3.svg1,311 × 567; 7 KB
Dinic algorithm Gf1.svg1,311 × 567; 7 KB
Dinic algorithm Gf2.svg1,311 × 638; 10 KB
Dinic algorithm Gf3.svg1,311 × 567; 10 KB
Dinic algorithm GL1.svg1,311 × 567; 6 KB
Dinic algorithm GL2.svg1,311 × 567; 5 KB
Dinic algorithm GL3.svg1,311 × 567; 3 KB
Dsa adj list.png302 × 462; 6 KB
Dsa adj matrix.png337 × 471; 17 KB
Dsa bfs 1.png685 × 183; 13 KB
Dsa bfs 2.png685 × 183; 13 KB
Dsa bfs 3.png685 × 183; 14 KB
Dsa bfs 4.png685 × 183; 14 KB
Dsa bfs 5.png685 × 183; 14 KB
Dsa bfs init.png685 × 183; 11 KB
Dsa bfs problem.png347 × 155; 6 KB
Dsa build tree.png768 × 806; 52 KB
Dsa dijkstra 1.png681 × 183; 14 KB
Dsa dijkstra 2.png681 × 183; 15 KB
Dsa dijkstra init.png685 × 183; 14 KB
Dsa dijkstra problem.png347 × 155; 7 KB
Dsa graph undirected.png729 × 210; 11 KB
Dsa graph.png288 × 193; 5 KB
Dsa grow tree hierarchy.png697 × 361; 25 KB
Dsa minimum spanning tree light edge proof 1.png451 × 395; 16 KB
Dsa minimum spanning tree light edge proof 2.png451 × 385; 13 KB
Dsa minimum spanning tree light edge.png618 × 379; 19 KB
Dsa minimum spanning tree prim 1.png721 × 383; 25 KB
Dsa minimum spanning tree prim 2.png721 × 383; 22 KB
Dsa minimum spanning tree problem.png347 × 155; 7 KB
Dsa minimum spanning tree solution.png347 × 155; 7 KB
Dsa proof tree e v minus 1.png750 × 155; 5 KB
Dsa spanning tree.png750 × 347; 16 KB
Dsa tn 2 tn div 3 plus o1.png425 × 512; 10 KB
Dsa tn tn div 2 plus o1.png118 × 512; 5 KB
Dsa trees 1 2 3.png731 × 130; 7 KB
Dsa trees 1 2.png185 × 80; 2 KB
Dsa trees no trees directed.png750 × 347; 19 KB
Dsa trees no trees.png750 × 347; 18 KB
Edge contraction in a multigraph.svg63 × 56; 3.07 MB
Edmonds augmenting path.svg800 × 550; 47 KB
Edmonds blossom.svg700 × 550; 81 KB
Edmonds lifting end point.svg750 × 850; 122 KB
Edmonds lifting path.svg800 × 860; 153 KB
Ek-flow 0.png200 × 114; 10 KB
Ek-flow 1.png200 × 114; 10 KB
Ek-flow 2.png200 × 114; 11 KB
Ek-flow 3.png200 × 114; 11 KB
Ek-flow 4.png200 × 114; 11 KB
Ek-flow comp1.png360 × 123; 15 KB
Eulertour bereinigt.svg461 × 496; 4 KB
Eulertour.svg390 × 425; 4 KB
Ex Dij 4.svg538 × 234; 46 KB
Ex Dij 5.svg538 × 234; 47 KB
Ex Dij 6.svg623 × 279; 71 KB
Ex prim 1.JPG244 × 320; 10 KB
Ex prim 2.JPG240 × 305; 11 KB
Ex prim 3.JPG222 × 303; 10 KB
Ex prim 4.JPG195 × 325; 11 KB
Ex prim 5.JPG191 × 323; 9 KB
Ex prim 6.JPG192 × 324; 8 KB
Ex prim 7.JPG123 × 345; 5 KB
Ex prim 8.JPG281 × 341; 9 KB
Ex prim.JPG271 × 330; 11 KB
Example1 Nal2T.jpg902 × 773; 42 KB
Example10 Nal2T.jpg843 × 765; 48 KB
Example11 Nal2T.jpg883 × 778; 48 KB
Example12 Nal2T.jpg835 × 768; 47 KB
Example13 Nal2T.jpg826 × 784; 49 KB
Example14 Nal2T.jpg805 × 780; 48 KB
Example15 Nal2T.jpg806 × 768; 48 KB
Example16 Nal2T.jpg858 × 775; 47 KB
Example17 Nal2T.jpg863 × 776; 135 KB
Example18 Nal2T.jpg833 × 786; 47 KB
Example19 Nal2T.jpg841 × 766; 46 KB
Example2 Nal2T.jpg830 × 786; 43 KB
Example3 Nal2T.jpg859 × 778; 44 KB
Example4 Nal2T.jpg801 × 721; 44 KB
Example5 Nal2T.jpg832 × 762; 44 KB
Example6 Nal2T.jpg818 × 772; 44 KB
Example7 Nal2T.jpg833 × 764; 43 KB
Example8 Nal2T.jpg850 × 758; 45 KB
Example9 Nal2T.jpg888 × 750; 47 KB
Exemplo Ndoiskas.JPG332 × 216; 8 KB
Floyd1.JPG575 × 716; 28 KB
Ford fulk worstcase 1.gif673 × 356; 5 KB
Ford fulk worstcase 2.gif674 × 357; 5 KB
Ford Fulkerson problem.png250 × 396; 29 KB
Ford-Fulkerson.GIF515 × 918; 32 KB
Ford-fulkerson.GIF621 × 971; 33 KB
FordFulkersonDemo.gif744 × 1,052; 363 KB
Forest expansion.png800 × 583; 31 KB
Forest expansion.svg512 × 350; 26 KB
G V'.svg390 × 390; 4 KB
Gomory–Hu G.svg1,311 × 567; 5 KB
Gomory–Hu Gp1.svg1,311 × 567; 5 KB
Gomory–Hu Gp2.svg815 × 354; 4 KB
Gomory–Hu Gp3.svg1,205 × 496; 5 KB
Gomory–Hu Gp4.svg1,063 × 390; 5 KB
Gomory–Hu Gp5.svg886 × 354; 4 KB
Gomory–Hu output.svg1,098 × 425; 4 KB
Gomory–Hu T.svg850 × 319; 3 KB
Gomory–Hu T1.svg886 × 354; 3 KB
Gomory–Hu T2.svg921 × 390; 4 KB
Gomory–Hu T3.svg1,063 × 461; 5 KB
Gomory–Hu T4.svg1,098 × 461; 5 KB
Gomory–Hu T5.svg1,134 × 461; 6 KB
Grafo usando algoritmo de profundida.png226 × 179; 11 KB
Graham Scan.svg160 × 440; 31 KB
Graph cut binary.svg189 × 249; 27 KB
Graph cut ternary.svg541 × 249; 30 KB
Graph suitable for Kameda's method.svg292 × 317; 29 KB
Graph-Coarsening-Process-Example.svg794 × 794; 100 KB
Graph-weighting-function.svg600 × 500; 5 KB
Graphe similarités coupe.png311 × 274; 4 KB
GuidoRossum.PNG708 × 670; 32 KB
Hakimi nem fut végig.png633 × 284; 13 KB
Hakimi végigfut.png578 × 480; 27 KB
HaseIgel.svg744 × 475; 26 KB
HaseIgel2.svg744 × 475; 25 KB
HaseIgel3.svg744 × 367; 19 KB
HCS Algorithm.gif400 × 300; 78 KB

(previous page) (next page)

Retrieved from "https://commons.wikimedia.org/w/index.php?title=Category:Graph_algorithms&oldid=314810751"

Non-topical/index:

[8]ページ先頭

©2009-2025 Movatter.jp