Jump to content

Category:Flow networks

From Wikimedia Commons, the free media repository

flow network

directed graph where each edge has a capacity and each edge receives a flow

Upload media

Subclass of

Depicts

transport network and road network

Has use

transport network

Authority file
Q1412924
Reasonator Scholia Wikidocumentaries PetScan statistics WikiMap Locator tool KML file Search depicted

Subcategories

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

?

Thuật toán kéo luồng sau đỉnh (7 F)

F

Ford-Fulkerson's algorithm (1 C, 47 F)

M

Minimum cost flow problem (1 C, 1 F)

W

Wye-Delta transform (36 F)

Media in category "Flow networks"

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

(previous page) (next page)

Baseball Elimination Problem.png 938 × 386; 42 KB
BeispielMaximalerFluss1.png 1,080 × 480; 12 KB
BeispielMaximalerFluss2.png 1,080 × 480; 30 KB
BeispielMaximalerFluss3.png 1,080 × 480; 12 KB
Dijkstra even odd solution 1.png 422 × 654; 18 KB
Dijkstra even odd solution 2.png 423 × 654; 25 KB
Dsa all pair cheapest path input.png 658 × 415; 16 KB
Dsa all pair cheapest path problem.png 193 × 135; 4 KB
Dsa bar node example.png 81 × 53; 964 bytes
Dsa bfs dijkstra transform.png 310 × 376; 11 KB
Dsa bfs small connected component case i.png 433 × 318; 7 KB
Dsa bfs small connected component case iii.png 433 × 322; 11 KB
Dsa bfs undirected problem.png 347 × 155; 5 KB
Dsa binary search tree in order.png 116 × 68; 1 KB
Dsa binary search tree post order.png 116 × 68; 1 KB
Dsa binary search tree pre order.png 116 × 68; 1 KB
Dsa binary search tree succ 1.png 294 × 241; 5 KB
Dsa binary search tree succ path up 1.png 592 × 551; 11 KB
Dsa binary search tree succ path up 2.png 592 × 551; 13 KB
Dsa binary search tree succ path up 3.png 592 × 551; 13 KB
Dsa binary search tree succ path up 4.png 592 × 551; 13 KB
Dsa binary search tree succ path up 5.png 592 × 551; 13 KB
Dsa binary search tree succ path up.png 592 × 551; 11 KB
Dsa bipartite matching reduced.png 347 × 266; 7 KB
Dsa bipartite matching solution.png 347 × 266; 9 KB
Dsa bipartite matching variation solution.png 347 × 266; 10 KB
Dsa bitonic euclidean tsp example 1.png 730 × 306; 9 KB
Dsa bitonic euclidean tsp example 2.png 734 × 306; 11 KB
Dsa bitonic euclidean tsp m i j and min cost.png 366 × 281; 4 KB
Dsa bitonic euclidean tsp proof case 2.png 734 × 306; 9 KB
Dsa bitonic euclidean tsp proof case 3.png 349 × 281; 5 KB
Dsa bitonic euclidean tsp symmetric.png 733 × 308; 10 KB
Dsa bst child parent 1.png 714 × 239; 10 KB
Dsa bst child parent 2.png 714 × 239; 9 KB
Dsa combine sort recurrence.png 608 × 320; 12 KB
Dsa dense bst member.png 729 × 319; 11 KB
Dsa dijkstra even odd problem.png 347 × 155; 7 KB
Dsa dijkstra proof case 1.png 650 × 124; 5 KB
Dsa dijkstra proof case 2.png 651 × 122; 7 KB
Dsa dijkstra proof path.png 644 × 68; 3 KB
Dsa dijkstra red black problem.png 347 × 155; 8 KB
Dsa dijkstra red black solution 2.png 422 × 654; 26 KB
Dsa dijkstra single negative edge problem.png 347 × 155; 7 KB
Dsa dijkstra single negative edge solution 2.png 423 × 654; 25 KB
Dsa disjoint paths transform.png 452 × 395; 11 KB
Dsa disjoint sets size join join 2.png 752 × 961; 18 KB
Dsa dynamic median solution finding med.png 270 × 87; 3 KB
Dsa dynamic median solution transfering.png 270 × 107; 3 KB
Dsa dynamic programming cloth cutting cutting example.png 656 × 433; 7 KB
Dsa dynamic programming cloth cutting example.png 327 × 183; 3 KB
Dsa dynamic programming cloth cutting horizontal.png 404 × 193; 3 KB
Dsa dynamic programming cloth cutting vertical.png 443 × 202; 4 KB
Dsa dynamic programming matrix chain mult memoized 1.png 308 × 262; 6 KB
Dsa dynamic programming matrix chain mult memoized 2.png 308 × 261; 5 KB
Dsa dynamic programming matrix chain mult memoized 3.png 308 × 261; 6 KB
Dsa dynamic programming matrix chain mult memoized.png 309 × 262; 6 KB
Dsa dynamic programming salmon fish memoized step 1.png 519 × 223; 11 KB
Dsa dynamic programming salmon fish memoized step 2.png 519 × 223; 11 KB
Dsa dynamic programming salmon fish memoized step 3.png 519 × 223; 10 KB
Dsa dynamic programming salmon fish memoized step n minus 1.png 327 × 146; 5 KB
Dsa dynamic programming salmon fish memoized step n.png 39 × 68; 1 KB
Dsa dynamic programming salmon fish memoized.png 520 × 223; 10 KB
Dsa dynamic programming salmon fish simple recurrence.png 635 × 270; 13 KB
Dsa efficient adj list imp solution.png 366 × 504; 8 KB
Dsa flow augmented.png 347 × 155; 10 KB
Dsa flow augmenting path.png 731 × 417; 26 KB
Dsa flow cut 1.png 423 × 779; 36 KB
Dsa flow cut 2.png 462 × 260; 13 KB
Dsa flow flow hierarchy.png 505 × 217; 14 KB
Dsa flow ishimoto cut.png 577 × 366; 15 KB
Dsa flow ishimoto problem.png 385 × 316; 10 KB
Dsa flow ishimoto solution.png 569 × 327; 14 KB
Dsa flow not legal flow.png 347 × 155; 10 KB
Dsa flow problem opt sol.png 347 × 155; 10 KB
Dsa flow problem.png 347 × 155; 8 KB
Dsa flow residual net.png 673 × 159; 9 KB
Dsa flow reuse edge after one.png 270 × 135; 6 KB
Dsa flow reuse edge after two.png 270 × 135; 6 KB
Dsa flow reuse edge counterexample setting.png 270 × 124; 5 KB
Dsa flow s cut size induction.png 423 × 529; 16 KB
Dsa flow whole flow better counterexample.png 308 × 155; 6 KB
Dsa flow whole flow counterexample setting.png 385 × 124; 5 KB
Dsa flow whole flow counterexample still.png 385 × 124; 6 KB
Dsa flow whole flow counterexample.png 385 × 124; 6 KB
Dsa flow whole flow counterexample2 1.png 270 × 124; 6 KB
Dsa flow whole flow counterexample2 2.png 273 × 141; 7 KB
Dsa flow whole flow counterexample2 setting.png 395 × 343; 11 KB
Dsa foo node example.png 87 × 48; 1 KB
Dsa foobar tree example.png 224 × 141; 3 KB
Dsa handshaking lemma.png 176 × 193; 4 KB
Dsa handshaking seating transform.png 384 × 385; 8 KB
Dsa k smallest in dense tree size.png 752 × 242; 9 KB
Dsa k smallest in dense tree tree size.png 752 × 242; 10 KB
Dsa k way merege lists init.png 599 × 308; 9 KB
Dsa k way merge lists step 1.png 599 × 308; 8 KB
Dsa k way merge lists step 2.png 519 × 308; 8 KB
Dsa linked list link.png 193 × 37; 457 bytes
Dsa list init.png 193 × 143; 3 KB
Dsa list pop back 1.png 232 × 143; 4 KB
Dsa list push front 1.png 239 × 143; 4 KB
Dsa list push front 2.png 243 × 143; 4 KB
Dsa list push front 3.png 315 × 143; 4 KB
Dsa list reverse solution.png 776 × 673; 22 KB
Dsa merge sort analysis.png 425 × 512; 12 KB
Dsa mst heaviest in circle before last alt.png 156 × 180; 4 KB
Dsa mst heaviest in circle before last.png 156 × 177; 3 KB
Dsa mst heaviest in circle init.png 156 × 174; 3 KB
Dsa mst uses lightest edge in graph.png 474 × 299; 9 KB
Dsa possible flow problem.png 375 × 155; 7 KB
Dsa possible red black tree possible.png 176 × 232; 5 KB
Dsa queue from 2 stacks proof init.png 352 × 347; 9 KB
Dsa queue from 2 stacks proof push.png 352 × 846; 19 KB
Dsa queue from 2 stacks proof top.png 352 × 798; 17 KB
Dsa really simple flow problem.png 347 × 155; 8 KB
Dsa really simple flow solution 1.png 731 × 155; 13 KB
Dsa really simple flow solution 2.png 731 × 155; 14 KB
Dsa really simple flow solution 3.png 731 × 155; 14 KB
Dsa red black tree ins prob.png 816 × 1,056; 21 KB
Dsa red black tree insert fixup child of root.png 734 × 157; 5 KB
Dsa red black tree insert fixup has red uncle.png 732 × 212; 10 KB
Dsa red black tree insert fixup zig zag.png 733 × 217; 10 KB
Dsa red black tree insert fixup zig zig.png 731 × 225; 10 KB
Dsa red black tree tree ins prob.png 714 × 330; 15 KB
Dsa red black tree tree.png 311 × 215; 6 KB
Dsa running time in post pre order indunction step.png 347 × 279; 7 KB
Dsa salmon fish examples.png 623 × 178; 9 KB
Dsa salmon fish setting.png 615 × 39; 3 KB
Dsa skyline houses.png 750 × 519; 10 KB
Dsa skyline skyline.png 750 × 519; 9 KB
Dsa sqrt recurrent tree.png 387 × 512; 8 KB
Dsa tn 2 t alpha n plus t 1 minus alpha n plus theta n.png 613 × 521; 14 KB
Dsa tree adding edge cycle cycle shown.png 347 × 196; 6 KB
Dsa tree adding edge cycle orig.png 347 × 155; 4 KB
Dsa tree adding edge cycle path shown.png 347 × 155; 5 KB
Dsa union find problem 2.png 270 × 299; 7 KB
Dsa union find problem.png 288 × 193; 5 KB
Dsa zbale bridge example.png 405 × 462; 8 KB
Duongtangluong.png 760 × 248; 50 KB
Edmonds-Karp flow example 0.svg 750 × 400; 25 KB
Edmonds-Karp flow example 1.svg 750 × 400; 25 KB
Edmonds-Karp flow example 2.svg 750 × 400; 25 KB
Edmonds-Karp flow example 3.svg 750 × 400; 25 KB
Edmonds-Karp flow example 4.svg 750 × 400; 25 KB
H8.png 814 × 536; 30 KB
It is circulation on graph and cut.png 1,456 × 1,366; 160 KB
It is circulation on graph.png 1,456 × 1,366; 157 KB
It is flow on graph.png 1,456 × 1,366; 157 KB
It is not circulation on graph.png 1,456 × 1,366; 156 KB
It is not flow on graph.png 1,456 × 1,366; 158 KB
Luong cuc dai 2.png 362 × 216; 20 KB
Luongsautang.png 769 × 200; 36 KB
Mang luong.png 766 × 233; 39 KB
Matran.png 718 × 561; 37 KB
Max flow residual.svg 790 × 430; 17 KB
Max flow.svg 790 × 430; 14 KB
Maximum bipartite matching to max flow.svg 815 × 390; 11 KB
MFP1.jpg 1,456 × 1,366; 201 KB
MFP2.jpg 2,425 × 817; 247 KB
Min cut.png 264 × 167; 11 KB
Min cut.svg 330 × 100; 11 KB
Mst distinct edges unique condensing after.png 279 × 262; 5 KB
Mst distinct edges unique condensing before.png 279 × 262; 5 KB
Mst distinct edges unique wrong proof alt.png 327 × 241; 5 KB
Mst distinct edges unique wrong proof.png 212 × 241; 3 KB
Multi-source multi-sink flow problem.svg 780 × 815; 17 KB
Network flow 8 vertices blank.svg 1,276 × 531; 10 KB
Network flow 8 vertices solution.svg 1,276 × 531; 10 KB
Network flow 9 vertices blank.svg 1,205 × 638; 12 KB
Network flow 9 vertices solution.svg 1,205 × 780; 12 KB
Network flow residual SVG.svg 2,424 × 1,197; 99 KB
Network flow residual.png 332 × 164; 23 KB
Network Flow Reversed Edge 0.svg 780 × 390; 5 KB
Network Flow Reversed Edge 1.svg 780 × 390; 5 KB
Network Flow Reversed Edge 2.svg 780 × 390; 5 KB
Network Flow Reversed Edge 3.svg 780 × 390; 5 KB
Network Flow SVG.svg 800 × 408; 37 KB
Network flow.png 332 × 165; 27 KB
Node splitting.svg 638 × 461; 10 KB
PipeNet.jpg 520 × 280; 21 KB
Push Relabel Algoritm Example - Initial Graph.svg 1,028 × 673; 8 KB
Push Relabel Algoritm Example - Step 1.svg 1,028 × 673; 10 KB
Push Relabel Algoritm Example - Step 2.svg 1,028 × 673; 10 KB
Push Relabel Algoritm Example - Step 3.svg 1,028 × 673; 9 KB
Push Relabel Algoritm Example - Step 4.svg 1,028 × 673; 10 KB
Push Relabel Algoritm Example - Step 5.svg 1,028 × 673; 9 KB
Push Relabel Algoritm Example - Step 6.svg 1,028 × 673; 9 KB
Push Relabel Algoritm Example - Step 7.svg 1,028 × 673; 10 KB
Push Relabel Algoritm Example - Step 8.svg 1,028 × 673; 11 KB
Push Relabel Algoritm Example - Step 9.svg 1,028 × 673; 11 KB
Push-Relabel Algorithm Example - Final Network Graph.svg 1,028 × 673; 8 KB
Push-Relabel Algorithm Example - Step 1.svg 1,028 × 673; 10 KB
Push-Relabel Algorithm Example - Step 2.svg 1,028 × 673; 10 KB
Push-Relabel Algorithm Example - Step 3.svg 1,028 × 673; 9 KB
Push-Relabel Algorithm Example - Step 4.svg 1,028 × 673; 10 KB
Push-Relabel Algorithm Example - Step 5.svg 1,028 × 673; 9 KB
Push-Relabel Algorithm Example - Step 6.svg 1,028 × 673; 9 KB
Push-Relabel Algorithm Example - Step 7.svg 1,028 × 673; 10 KB
Push-Relabel Algorithm Example - Step 8.svg 1,028 × 673; 11 KB
Push-Relabel Algorithm Example - Step 9.svg 1,028 × 673; 11 KB
Red de flujo.jpg 507 × 293; 37 KB

(previous page) (next page)

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

Non-topical/index:

Uses of Wikidata Infobox