Category:Graph algorithms

Da Wikimedia Commons, l'archivio di file multimediali liberi

Vai alla navigazione Vai alla ricerca

algoritmo sui grafi

type of algorithm

Carica un file multimediale

Sottoclasse di

algoritmo combinatorio

Parte di

teoria dei grafi

Authority file
Q30503704 identificativo NKC: ph770865
Reasonator Scholia Wikidocumentaries PetScan statistica WikiMap Locator tool file KML Cerca tra le rappresentazioni

English: Graph algorithms solve problems related to graph theory.

Sottocategorie

Questa categoria contiene le 14 sottocategorie indicate di seguito, su un totale di 14.

B

D

Depth-first search‎ (1 P, 50 F)

F

Flow networks‎ (3 C, 97 F)
Ford-Fulkerson's algorithm‎ (1 C, 40 F)

H

Hierholzer's algorithm‎ (11 F)

I

Graph isomorphism‎ (16 F)

L

Line graph construction‎ (9 F)

M

Minimum spanning trees‎ (1 C, 20 F)

S

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

T

Thermal profiling graphs‎ (13 F)

V

Videos of graph algorithms‎ (1 F)

File nella categoria "Graph algorithms"

Questa categoria contiene 200 file, indicati di seguito, su un totale di 279.

(pagina precedente) (pagina successiva)

10 repetitions of Karger’s contraction procedure.svg 765 × 990; 3,11 MB
15-node network containing a combination of bi-directional and uni-directional links.png 515 × 313; 40 KB
6 centrality measures.png 600 × 900; 378 KB
AB pruning annotated.svg 1 212 × 615; 61 KB
AB pruning.svg 1 212 × 615; 43 KB
Algorithm Tarjan.png 544 × 432; 7 KB
Algorithme de johnson 1.svg 163 × 146; 20 KB
Algorithme de johnson étape 4.jpg 500 × 448; 31 KB
Algorithme de Johnson.svg 747 × 297; 20 KB
Algorithme de kosaraju exemple.svg 256 × 155; 21 KB
Alpha-beta cuts.png 644 × 308; 10 KB
Anchor Modeling Example.svg 1 449 × 763; 41 KB
AntColony.gif 860 × 321; 288 KB
Astar progress animation.gif 210 × 210; 50 KB
AStar.gif 346 × 352; 41 KB
Augmenting path.png 812 × 593; 14 KB
Barabasi Albert generated network.jpg 360 × 210; 7 KB
Beispiel Ungarische Methode.svg 512 × 461; 16 KB
BFS-Algorithm Search Way zh-hans.gif 480 × 360; 212 KB
BFS-Algorithm Search Way zh-hant.gif 480 × 360; 440 KB
BFS-Algorithm Search Way.gif 480 × 360; 660 KB
Blossom contraction.png 836 × 578; 36 KB
Blossom contraction.svg 512 × 381; 153 KB
Blossom end point path lifting.png 875 × 484; 26 KB
Boruvka Step 1.svg 618 × 518; 18 KB
Boruvka Step 2.svg 744 × 600; 18 KB
Boruvka Step 3.svg 744 × 600; 15 KB
Boruvka Step 4.svg 744 × 600; 13 KB
Boruvka Step 5.svg 744 × 600; 11 KB
Brute force Clique algorithm.svg 546 × 540; 115 KB
Camerini Algorithm 1.svg 618 × 518; 18 KB
Camerini Algorithm 2.svg 618 × 518; 14 KB
Camerini Algorithm 3.svg 1 380 × 470; 22 KB
Camerini Algorithm 4.svg 1 379 × 468; 21 KB
Can 73 cm.pdf 785 × 820; 19 KB
Can 73 cm.svg 471 × 493; 147 KB
Can 73 rcm.pdf 785 × 820; 19 KB
Can 73 rcm.svg 471 × 493; 147 KB
Christofides Matching.svg 390 × 390; 3 KB
Christofides MST.svg 390 × 390; 3 KB
Component amirali.jpeg 734 × 461; 20 KB
Component amiralii.jpeg 695 × 507; 19 KB
Contraction vertices.jpg 632 × 354; 16 KB
ContractionHierarchies1.png 547 × 291; 9 KB
ContractionHierarchies2.png 531 × 290; 10 KB
ContractionHierarchies3.png 437 × 285; 6 KB
ContractionHierarchies4.png 543 × 378; 10 KB
CPT-Graphs-directed-unweighted-ex1.svg 381 × 350; 16 KB
CPT-Graphs-directed-unweighted.svg 365 × 466; 21 KB
CPT-Graphs-directed-weighted-ex1.svg 670 × 600; 1 KB
CPT-Graphs-directed-weighted-ex2.svg 365 × 333; 20 KB
CPT-Graphs-directed-weighted.svg 365 × 466; 28 KB
CPT-Graphs-undirected-unweighted-ex1.svg 269 × 251; 7 KB
CPT-Graphs-undirected-unweighted-loop-multiedge.svg 324 × 301; 11 KB
CPT-Graphs-undirected-unweighted-noloop-nomultiedge.svg 324 × 301; 11 KB
CPT-Graphs-undirected-unweighted.svg 365 × 466; 14 KB
CPT-Graphs-undirected-weighted-loop-multiedge.svg 324 × 301; 14 KB
CPT-Graphs-undirected-weighted.svg 365 × 466; 19 KB
Critical path algorithm.svg 330 × 179; 48 KB
Cross blossom path lifting.png 941 × 410; 32 KB
Cut and minimum spanning tree of a graph.svg 890 × 655; 14 KB
CycleFindingNew.png 235 × 263; 16 KB
Decade this far wealth vs internet growth.png 800 × 600; 33 KB
Deletion-contraction.svg 443 × 328; 21 KB
DFS finding cycle.gif 1 030 × 660; 68 KB
DijkstraDemo.gif 521 × 518; 5,94 MB
Dijkstrapaso6.jpg 497 × 253; 17 KB
Dijkstras progress animation.gif 210 × 210; 128 KB
Dinic algorithm G1.svg 1 311 × 567; 7 KB
Dinic algorithm G2.svg 1 311 × 567; 7 KB
Dinic algorithm G3.svg 1 311 × 567; 7 KB
Dinic algorithm Gf1.svg 1 311 × 567; 7 KB
Dinic algorithm Gf2.svg 1 311 × 638; 10 KB
Dinic algorithm Gf3.svg 1 311 × 567; 10 KB
Dinic algorithm GL1.svg 1 311 × 567; 6 KB
Dinic algorithm GL2.svg 1 311 × 567; 5 KB
Dinic algorithm GL3.svg 1 311 × 567; 3 KB
Dsa adj list.png 302 × 462; 6 KB
Dsa adj matrix.png 337 × 471; 17 KB
Dsa bfs 1.png 685 × 183; 13 KB
Dsa bfs 2.png 685 × 183; 13 KB
Dsa bfs 3.png 685 × 183; 14 KB
Dsa bfs 4.png 685 × 183; 14 KB
Dsa bfs 5.png 685 × 183; 14 KB
Dsa bfs init.png 685 × 183; 11 KB
Dsa bfs problem.png 347 × 155; 6 KB
Dsa build tree.png 768 × 806; 52 KB
Dsa dijkstra 1.png 681 × 183; 14 KB
Dsa dijkstra 2.png 681 × 183; 15 KB
Dsa dijkstra init.png 685 × 183; 14 KB
Dsa dijkstra problem.png 347 × 155; 7 KB
Dsa graph undirected.png 729 × 210; 11 KB
Dsa graph.png 288 × 193; 5 KB
Dsa grow tree hierarchy.png 697 × 361; 25 KB
Dsa minimum spanning tree light edge proof 1.png 451 × 395; 16 KB
Dsa minimum spanning tree light edge proof 2.png 451 × 385; 13 KB
Dsa minimum spanning tree light edge.png 618 × 379; 19 KB
Dsa minimum spanning tree prim 1.png 721 × 383; 25 KB
Dsa minimum spanning tree prim 2.png 721 × 383; 22 KB
Dsa minimum spanning tree problem.png 347 × 155; 7 KB
Dsa minimum spanning tree solution.png 347 × 155; 7 KB
Dsa proof tree e v minus 1.png 750 × 155; 5 KB
Dsa spanning tree.png 750 × 347; 16 KB
Dsa tn 2 tn div 3 plus o1.png 425 × 512; 10 KB
Dsa tn tn div 2 plus o1.png 118 × 512; 5 KB
Dsa trees 1 2 3.png 731 × 130; 7 KB
Dsa trees 1 2.png 185 × 80; 2 KB
Dsa trees no trees directed.png 750 × 347; 19 KB
Dsa trees no trees.png 750 × 347; 18 KB
Edge contraction in a multigraph.svg 63 × 56; 3,07 MB
Edmonds augmenting path.svg 800 × 550; 47 KB
Edmonds blossom.svg 700 × 550; 81 KB
Edmonds lifting end point.svg 750 × 850; 122 KB
Edmonds lifting path.svg 800 × 860; 153 KB
Ek-flow 0.png 200 × 114; 10 KB
Ek-flow 1.png 200 × 114; 10 KB
Ek-flow 2.png 200 × 114; 11 KB
Ek-flow 3.png 200 × 114; 11 KB
Ek-flow 4.png 200 × 114; 11 KB
Ek-flow comp1.png 360 × 123; 15 KB
Eulertour bereinigt.svg 461 × 496; 4 KB
Eulertour.svg 390 × 425; 4 KB
Ex prim 1.JPG 244 × 320; 10 KB
Ex prim 2.JPG 240 × 305; 11 KB
Ex prim 3.JPG 222 × 303; 10 KB
Ex prim 4.JPG 195 × 325; 11 KB
Ex prim 5.JPG 191 × 323; 9 KB
Ex prim 6.JPG 192 × 324; 8 KB
Ex prim 7.JPG 123 × 345; 5 KB
Ex prim 8.JPG 281 × 341; 9 KB
Ex prim.JPG 271 × 330; 11 KB
Example1 Nal2T.jpg 902 × 773; 42 KB
Example10 Nal2T.jpg 843 × 765; 48 KB
Example11 Nal2T.jpg 883 × 778; 48 KB
Example12 Nal2T.jpg 835 × 768; 47 KB
Example13 Nal2T.jpg 826 × 784; 49 KB
Example14 Nal2T.jpg 805 × 780; 48 KB
Example15 Nal2T.jpg 806 × 768; 48 KB
Example16 Nal2T.jpg 858 × 775; 47 KB
Example17 Nal2T.jpg 863 × 776; 135 KB
Example18 Nal2T.jpg 833 × 786; 47 KB
Example19 Nal2T.jpg 841 × 766; 46 KB
Example2 Nal2T.jpg 830 × 786; 43 KB
Example3 Nal2T.jpg 859 × 778; 44 KB
Example4 Nal2T.jpg 801 × 721; 44 KB
Example5 Nal2T.jpg 832 × 762; 44 KB
Example6 Nal2T.jpg 818 × 772; 44 KB
Example7 Nal2T.jpg 833 × 764; 43 KB
Example8 Nal2T.jpg 850 × 758; 45 KB
Example9 Nal2T.jpg 888 × 750; 47 KB
Exemplo Ndoiskas.JPG 332 × 216; 8 KB
Floyd1.JPG 575 × 716; 28 KB
Ford fulk worstcase 1.gif 673 × 356; 5 KB
Ford fulk worstcase 2.gif 674 × 357; 5 KB
Ford Fulkerson problem.png 250 × 396; 29 KB
Ford-Fulkerson.GIF 515 × 918; 32 KB
Ford-fulkerson.GIF 621 × 971; 33 KB
FordFulkersonDemo.gif 744 × 1 052; 363 KB
Forest expansion.png 800 × 583; 31 KB
Forest expansion.svg 512 × 350; 26 KB
G V'.svg 390 × 390; 4 KB
Gomory–Hu G.svg 1 311 × 567; 5 KB
Gomory–Hu Gp1.svg 1 311 × 567; 5 KB
Gomory–Hu Gp2.svg 815 × 354; 4 KB
Gomory–Hu Gp3.svg 1 205 × 496; 5 KB
Gomory–Hu Gp4.svg 1 063 × 390; 5 KB
Gomory–Hu Gp5.svg 886 × 354; 4 KB
Gomory–Hu output.svg 1 098 × 425; 4 KB
Gomory–Hu T.svg 850 × 319; 3 KB
Gomory–Hu T1.svg 886 × 354; 3 KB
Gomory–Hu T2.svg 921 × 390; 4 KB
Gomory–Hu T3.svg 1 063 × 461; 5 KB
Gomory–Hu T4.svg 1 098 × 461; 5 KB
Gomory–Hu T5.svg 1 134 × 461; 6 KB
Grafo usando algoritmo de profundida.png 226 × 179; 11 KB
Graham Scan.svg 160 × 440; 31 KB
Graph suitable for Kameda's method.svg 292 × 317; 29 KB
Graph-weighting-function.svg 600 × 500; 5 KB
Graphe similarités coupe.png 311 × 274; 4 KB
GuidoRossum.PNG 708 × 670; 32 KB
HaseIgel.svg 744 × 475; 26 KB
HCS Algorithm.gif 400 × 300; 78 KB
Heuristic-straight-line-distance.svg 600 × 500; 4 KB
Hopcroft Karp example.jpg 1 128 × 949; 234 KB
Hopcroft Karp matching.jpg 1 114 × 969; 232 KB
Hopcroft-karp matching.jpg 1 114 × 969; 232 KB
Hopcroft-Karp-exemple-deuxieme-partie.jpg 483 × 427; 187 KB
Hopcroft-Karp-exemple-premiere-partie.jpg 481 × 428; 166 KB
Hopcroft-karp.jpg 728 × 969; 145 KB
HopcroftKarpExample.png 712 × 424; 48 KB
Iterative deepening to level 1.jpg 310 × 176; 7 KB
Iterative deepening to level 2.jpg 384 × 246; 12 KB
Iterative deepening to level 3.jpg 407 × 311; 22 KB
Jeu-Isaacs.svg 830 × 827; 117 KB
JKMP graphe.svg 677 × 302; 10 KB
K-nearest-neighbor Verfahren.png 248 × 189; 24 KB
Kameda's algorithm run.svg 292 × 317; 29 KB
Karger Basic.jpg 1 282 × 285; 29 KB
Knnclass.png 284 × 242; 22 KB
KruskalDemo.gif 314 × 323; 415 KB

(pagina precedente) (pagina successiva)

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

Categorie nascoste: