User contributions for Weihe
Jump to navigation
Jump to search
9 November 2014
- 10:3810:38, 9 November 2014 diff hist +18 Basic flow definitions →Feasible flow and flow value
- 10:3810:38, 9 November 2014 diff hist −1 Basic flow definitions →Feasible flow and flow value
- 10:3710:37, 9 November 2014 diff hist 0 Basic flow definitions No edit summary
- 10:3610:36, 9 November 2014 diff hist +6 Basic flow definitions →Preflow
- 10:3610:36, 9 November 2014 diff hist −2 Basic flow definitions →Preflow
- 10:3510:35, 9 November 2014 diff hist +10 Basic flow definitions →Flows and preflows
- 10:3410:34, 9 November 2014 diff hist +843 Basic flow definitions →Flows and preflows
- 10:1410:14, 9 November 2014 diff hist +12 Basic flow definitions →Flows and preflows
- 10:1410:14, 9 November 2014 diff hist +10 Basic flow definitions →Basic setting
- 10:1310:13, 9 November 2014 diff hist +22 Basic flow definitions →Basic setting
- 10:1210:12, 9 November 2014 diff hist −1 Basic flow definitions →Basic setting
- 10:1110:11, 9 November 2014 diff hist +41 Basic flow definitions →Basic setting
- 10:1110:11, 9 November 2014 diff hist −3 Basic flow definitions →Basic setting
- 10:1010:10, 9 November 2014 diff hist +1,067 Basic flow definitions No edit summary
- 09:2809:28, 9 November 2014 diff hist +19 Basic flow definitions →Basic setting
- 09:2509:25, 9 November 2014 diff hist +633 Basic flow definitions →Basic setting
- 09:1609:16, 9 November 2014 diff hist +1,058 Basic flow definitions →Assumptions
- 08:4908:49, 9 November 2014 diff hist +2 Basic flow definitions →Assumptions
- 08:4708:47, 9 November 2014 diff hist +356 Basic flow definitions →Flow-augmenting path
- 08:4208:42, 9 November 2014 diff hist 0 Basic flow definitions →Flow-augmenting path
- 08:4008:40, 9 November 2014 diff hist +1 Basic flow definitions →Definition
- 08:3708:37, 9 November 2014 diff hist +238 Basic flow definitions →Flow-augmenting path
- 08:3408:34, 9 November 2014 diff hist +68 Basic flow definitions →Flow-augmenting path
- 08:3108:31, 9 November 2014 diff hist +539 Basic flow definitions →Flow-augmenting path
8 November 2014
- 17:5117:51, 8 November 2014 diff hist +1,021 Basic flow definitions →Flow-augmenting path
- 17:5017:50, 8 November 2014 diff hist +2 Ford-Fulkerson →Induction step
- 17:5017:50, 8 November 2014 diff hist −660 Ford-Fulkerson →Induction step
- 17:4417:44, 8 November 2014 diff hist −1,204 Ford-Fulkerson →Induction step
- 17:3817:38, 8 November 2014 diff hist +73 Basic flow definitions →Residual network
- 17:3717:37, 8 November 2014 diff hist +272 Basic flow definitions →Residual network
- 17:3017:30, 8 November 2014 diff hist +2 Basic flow definitions →Residual network
- 17:2917:29, 8 November 2014 diff hist −2 Basic flow definitions →Definition
- 17:2817:28, 8 November 2014 diff hist +342 Basic flow definitions →Definition
- 17:2317:23, 8 November 2014 diff hist +51 Basic flow definitions No edit summary
- 16:5916:59, 8 November 2014 diff hist −2 Basic graph definitions →Cycles
- 16:5816:58, 8 November 2014 diff hist +4 Basic graph definitions →Cycles
- 16:5716:57, 8 November 2014 diff hist +403 Basic graph definitions →Cycles
7 November 2014
- 11:1411:14, 7 November 2014 diff hist +26 Classical eulerian cycle algorithm →Correctness
- 11:1211:12, 7 November 2014 diff hist +8 Classical eulerian cycle algorithm →Correctness
- 11:1011:10, 7 November 2014 diff hist 0 Classical eulerian cycle algorithm →Induction step
- 11:1011:10, 7 November 2014 diff hist +47 Classical eulerian cycle algorithm →Induction step
- 11:0511:05, 7 November 2014 diff hist +23 Classical eulerian cycle algorithm →General information
- 11:0311:03, 7 November 2014 diff hist −3 Index handler with list of unused →Methods current
- 11:0311:03, 7 November 2014 diff hist −2 Branching by Edmonds No edit summary
- 11:0211:02, 7 November 2014 diff hist −12 Index handler No edit summary current
- 11:0111:01, 7 November 2014 diff hist +5 Eulerian cycle →Output
- 11:0011:00, 7 November 2014 diff hist −2 Eulerian cycle →Definition
- 11:0011:00, 7 November 2014 diff hist +1 Eulerian cycle →Definition
- 10:5910:59, 7 November 2014 diff hist +503 Eulerian cycle →Definition
- 10:5510:55, 7 November 2014 diff hist 0 Eulerian cycle →Output
- 10:5310:53, 7 November 2014 diff hist −115 Eulerian cycle →Definition
- 10:5310:53, 7 November 2014 diff hist +45 Eulerian cycle →Definition
- 10:5210:52, 7 November 2014 diff hist −10 Branching by Edmonds →Remarks
- 10:5110:51, 7 November 2014 diff hist +19 Branching by Edmonds →Complexity
- 10:4910:49, 7 November 2014 diff hist +41 Branching by Edmonds →Induction step
- 10:4510:45, 7 November 2014 diff hist +78 Branching by Edmonds →Abstract view
- 10:4210:42, 7 November 2014 diff hist +164 Basic graph definitions →Forests, trees, branchings, arborescences
- 10:4010:40, 7 November 2014 diff hist +37 Basic graph definitions →Connectedness
- 10:3810:38, 7 November 2014 diff hist +76 Basic graph definitions →Connectedness
- 10:3010:30, 7 November 2014 diff hist +8 Basic graph definitions →Cycles
- 10:2910:29, 7 November 2014 diff hist −6 Basic graph definitions →Subgraphs
- 10:2810:28, 7 November 2014 diff hist +20 Basic graph definitions →Transpose of a graph
- 10:2710:27, 7 November 2014 diff hist +119 Basic graph definitions →Transpose of a graph
- 10:2610:26, 7 November 2014 diff hist +3 Basic graph definitions →Representations of graphs
- 10:2410:24, 7 November 2014 diff hist 0 Basic graph definitions →Directed and undirected graphs
- 10:2410:24, 7 November 2014 diff hist +2 Basic graph definitions →Directed and undirected graphs
- 10:2410:24, 7 November 2014 diff hist +92 Basic graph definitions →Directed and undirected graphs
5 November 2014
- 11:1111:11, 5 November 2014 diff hist +169 Sets and sequences No edit summary
4 November 2014
- 12:1312:13, 4 November 2014 diff hist +2 Depth-first search →Induction step
- 12:1212:12, 4 November 2014 diff hist −1 Depth-first search →Induction step
3 November 2014
- 07:3707:37, 3 November 2014 diff hist +14 Kosaraju →Correctness
- 07:3607:36, 3 November 2014 diff hist −1 Kosaraju →Correctness
- 07:3607:36, 3 November 2014 diff hist −69 Kosaraju →Correctness
- 07:3407:34, 3 November 2014 diff hist +10 Kosaraju →Abstract View
- 07:3307:33, 3 November 2014 diff hist −5 Kosaraju →Abstract View
- 07:2807:28, 3 November 2014 diff hist −1 Repeated depth-first search →Abstract View current
- 07:2707:27, 3 November 2014 diff hist −33 Repeated depth-first search →General information
- 07:2707:27, 3 November 2014 diff hist +101 Repeated depth-first search →General information
- 07:2607:26, 3 November 2014 diff hist 0 Repeated depth-first search No edit summary
- 07:2507:25, 3 November 2014 diff hist 0 Repeated depth-first search →General information
- 07:2507:25, 3 November 2014 diff hist +258 Repeated depth-first search No edit summary
- 07:2107:21, 3 November 2014 diff hist +2 Exhaustive graph traversal No edit summary current
- 07:2007:20, 3 November 2014 diff hist +484 Kosaraju No edit summary
- 07:1907:19, 3 November 2014 diff hist −612 Strongly connected components No edit summary
- 07:1807:18, 3 November 2014 diff hist +3 Basic graph definitions →Connectedness
- 07:1807:18, 3 November 2014 diff hist +72 Basic graph definitions →Connectedness
- 07:1707:17, 3 November 2014 diff hist −437 Strongly connected components No edit summary
- 07:1507:15, 3 November 2014 diff hist +11 Basic graph definitions →Connectedness
- 07:1507:15, 3 November 2014 diff hist +55 Basic graph definitions →Connectedness
31 October 2014
- 13:4713:47, 31 October 2014 diff hist 0 Hopcroft-Tarjan →Correctness
- 13:4613:46, 31 October 2014 diff hist +29 Hopcroft-Tarjan →Correctness
- 13:4313:43, 31 October 2014 diff hist +9 Hopcroft-Tarjan →Step 2
- 13:4013:40, 31 October 2014 diff hist −30 Hopcroft-Tarjan →Step 1
- 13:4013:40, 31 October 2014 diff hist +1 Hopcroft-Tarjan →Step 1
- 13:3613:36, 31 October 2014 diff hist +210 Hopcroft-Tarjan →Step 1
- 12:4012:40, 31 October 2014 diff hist +122 Biconnected components →Input
- 12:3512:35, 31 October 2014 diff hist +5 Breadth-first search →Remark
- 12:3512:35, 31 October 2014 diff hist −69 Breadth-first search →Complexity
- 12:3212:32, 31 October 2014 diff hist +1 Breadth-first search →Correctness
- 12:2712:27, 31 October 2014 diff hist +592 Breadth-first search →Correctness
- 12:1912:19, 31 October 2014 diff hist +54 Breadth-first search →Induction step
- 12:1812:18, 31 October 2014 diff hist +37 Breadth-first search →Abstract view
- 12:1412:14, 31 October 2014 diff hist −13 Sets and sequences →Stacks and queues
- 12:1012:10, 31 October 2014 diff hist +8 Sets and sequences →Stacks and queues
- 12:0912:09, 31 October 2014 diff hist +510 Sets and sequences →Ordered and sorted sequences
- 11:5811:58, 31 October 2014 diff hist +47 Depth-first search →Correctness
- 11:4811:48, 31 October 2014 diff hist +1 Depth-first search →Induction step
- 11:4811:48, 31 October 2014 diff hist +1 Depth-first search →Induction step
- 11:4711:47, 31 October 2014 diff hist +370 Depth-first search →Induction step
- 11:4011:40, 31 October 2014 diff hist +58 Basic graph definitions →Forests, trees, branchings, arborescences
- 11:3911:39, 31 October 2014 diff hist 0 Depth-first search →Abstract view
- 11:3911:39, 31 October 2014 diff hist +1 Depth-first search →Abstract view
- 11:3611:36, 31 October 2014 diff hist +457 Depth-first search →Abstract view
- 11:2811:28, 31 October 2014 diff hist +52 Basic graph definitions →Forests, trees, branchings, arborescences
- 11:2711:27, 31 October 2014 diff hist +163 Basic graph definitions →Forests, trees, branchings, arborescences
- 11:2511:25, 31 October 2014 diff hist +375 Basic graph definitions No edit summary
- 11:1511:15, 31 October 2014 diff hist +6 Graph traversal →Remarks
- 11:1511:15, 31 October 2014 diff hist +242 Graph traversal →Remarks
- 10:4510:45, 31 October 2014 diff hist +265 Graph traversal →Remarks
- 10:3910:39, 31 October 2014 diff hist +93 Graph traversal →Output
- 10:3210:32, 31 October 2014 diff hist +1 Sets and sequences →Ordered and sorted sequences
- 10:3110:31, 31 October 2014 diff hist +17 Sets and sequences →Ordered and sorted sequences
- 10:3110:31, 31 October 2014 diff hist +5 Sets and sequences →Ordered and sorted sequences
- 10:3010:30, 31 October 2014 diff hist +124 Sets and sequences →Maximal and minimal sets
- 10:2910:29, 31 October 2014 diff hist +2 Basic graph definitions →Connectedness
- 10:2810:28, 31 October 2014 diff hist +10 Basic graph definitions →Connectedness
- 10:2510:25, 31 October 2014 diff hist +190 Basic graph definitions →Connectedness
- 10:2110:21, 31 October 2014 diff hist 0 Basic graph definitions →Cycles
- 10:2010:20, 31 October 2014 diff hist +1 Basic graph definitions →Cycles
- 10:2010:20, 31 October 2014 diff hist 0 Basic graph definitions →Cycles
- 10:2010:20, 31 October 2014 diff hist +83 Basic graph definitions →Cycles
- 10:1910:19, 31 October 2014 diff hist +256 Basic graph definitions No edit summary
- 10:1610:16, 31 October 2014 diff hist +12 Basic graph definitions →Cycles
- 10:1510:15, 31 October 2014 diff hist +2 Basic graph definitions →Paths
- 10:1410:14, 31 October 2014 diff hist +119 Basic graph definitions →Paths
- 10:1310:13, 31 October 2014 diff hist −60 Basic graph definitions →Paths
- 09:5709:57, 31 October 2014 diff hist −1 Basic graph definitions →Subgraphs
- 09:5609:56, 31 October 2014 diff hist +45 Basic graph definitions →Subgraphs
- 09:5509:55, 31 October 2014 diff hist +1 Basic graph definitions →Transpose of a graph
- 09:5409:54, 31 October 2014 diff hist +167 Basic graph definitions →Transpose of a graph
- 09:5109:51, 31 October 2014 diff hist +140 Basic graph definitions →Representations of graphs
- 09:4809:48, 31 October 2014 diff hist +35 Basic graph definitions →Representations of graphs
- 09:4709:47, 31 October 2014 diff hist +1 Basic graph definitions →Adjacency, incidence, and degree
- 09:4709:47, 31 October 2014 diff hist +2 Basic graph definitions →Adjacency, incidence, and degree
- 09:4709:47, 31 October 2014 diff hist +93 Basic graph definitions →Adjacency, incidence, and degree
- 09:4509:45, 31 October 2014 diff hist −1 Basic graph definitions →Directed and undirected graphs
- 09:4409:44, 31 October 2014 diff hist +2 Basic graph definitions →Directed and undirected graphs
- 09:4409:44, 31 October 2014 diff hist +86 Basic graph definitions →Directed and undirected graphs
- 09:4209:42, 31 October 2014 diff hist +2 Sets and sequences →Maximal and minimal sets
- 09:4109:41, 31 October 2014 diff hist +1 Sets and sequences →Maximal and minimal sets
- 09:4109:41, 31 October 2014 diff hist +1 Sets and sequences →Maximal and minimal sets
- 09:4109:41, 31 October 2014 diff hist +199 Sets and sequences →Maximal and minimal sets
- 09:3709:37, 31 October 2014 diff hist 0 Sets and sequences →Maximal and minimal sets
- 09:3709:37, 31 October 2014 diff hist −2 Sets and sequences →Maximal and minimal sets
- 09:3709:37, 31 October 2014 diff hist +2 Sets and sequences →Maximal and minimal sets
- 09:3609:36, 31 October 2014 diff hist +324 Sets and sequences →Sets and multisets
30 October 2014
- 16:1616:16, 30 October 2014 diff hist +186 Hopcroft-Tarjan →Step 1
- 16:1116:11, 30 October 2014 diff hist +2 Hopcroft-Tarjan →Step 1
- 16:1116:11, 30 October 2014 diff hist +157 Hopcroft-Tarjan →Step 1
- 16:1016:10, 30 October 2014 diff hist +462 Hopcroft-Tarjan →Correctness
- 16:0116:01, 30 October 2014 diff hist −202 Hopcroft-Tarjan →Correctness
- 15:4415:44, 30 October 2014 diff hist +74 Hopcroft-Tarjan →Step 2
- 15:4015:40, 30 October 2014 diff hist +1 Hopcroft-Tarjan →Step 1
- 15:4015:40, 30 October 2014 diff hist +38 Hopcroft-Tarjan →Step 1
- 15:3615:36, 30 October 2014 diff hist +5 Hopcroft-Tarjan →Step 1
- 15:3515:35, 30 October 2014 diff hist +530 Hopcroft-Tarjan →Step 1
- 15:2815:28, 30 October 2014 diff hist +74 Hopcroft-Tarjan →Step 2
- 15:1815:18, 30 October 2014 diff hist +304 Basic graph definitions →Connectedness
- 15:0915:09, 30 October 2014 diff hist +464 Hopcroft-Tarjan →Correctness
- 14:5614:56, 30 October 2014 diff hist −1 Basic graph definitions →Subgraphs
- 14:5514:55, 30 October 2014 diff hist +68 Basic graph definitions →Subgraphs
- 14:3314:33, 30 October 2014 diff hist +4 Hopcroft-Tarjan →Correctness
- 14:3214:32, 30 October 2014 diff hist −1 Hopcroft-Tarjan →Correctness
- 14:2414:24, 30 October 2014 diff hist +843 Hopcroft-Tarjan →Correctness
- 14:1814:18, 30 October 2014 diff hist +14 Biconnected components →Input
- 14:1814:18, 30 October 2014 diff hist +16 Biconnected components →Input
- 14:1714:17, 30 October 2014 diff hist +37 Biconnected components →Input
- 13:1013:10, 30 October 2014 diff hist +172 Hopcroft-Tarjan No edit summary
- 12:5012:50, 30 October 2014 diff hist +1 Hopcroft-Tarjan →Step 1
- 12:4912:49, 30 October 2014 diff hist +6 Hopcroft-Tarjan →Step 1
- 12:4912:49, 30 October 2014 diff hist +1,781 N Hopcroft-Tarjan Created page with "== Abstract view == '''Algorithmic problem:''' Biconnected components '''Type of algorithm:''' two steps. == Step 1 == '''Abstract view:''' A variation of Depth-firs..."
- 12:0412:04, 30 October 2014 diff hist +299 N Biconnected components Created page with "== Input == An undirected graph <math>G=(V,E)</math>. == Output == A set of sets of nodes such that each set of nodes is..."
- 11:5611:56, 30 October 2014 diff hist 0 Basic graph definitions No edit summary
- 11:5511:55, 30 October 2014 diff hist +1 Basic graph definitions →Connectedness
- 11:5411:54, 30 October 2014 diff hist +1 Basic graph definitions →Connectedness
- 11:5411:54, 30 October 2014 diff hist +1 Basic graph definitions →Connectedness
- 11:5411:54, 30 October 2014 diff hist +1 Basic graph definitions →Connectedness
- 11:5311:53, 30 October 2014 diff hist −1 Basic graph definitions →Connectedness
- 11:5311:53, 30 October 2014 diff hist +212 Basic graph definitions →Connectedness
- 11:5111:51, 30 October 2014 diff hist +704 Basic graph definitions →Connectedness
- 10:5710:57, 30 October 2014 diff hist +21 Basic graph definitions →Connectedness
- 10:5610:56, 30 October 2014 diff hist +214 Basic graph definitions →Paths
29 October 2014
- 15:0215:02, 29 October 2014 diff hist +1 Preflow-push with excess scaling →Induction step
- 15:0115:01, 29 October 2014 diff hist +1 Preflow-push with excess scaling →Abstract view
- 15:0115:01, 29 October 2014 diff hist +47 Preflow-push with excess scaling →Abstract view
- 13:5513:55, 29 October 2014 diff hist +77 Preflow-push with excess scaling →Induction step
- 13:5313:53, 29 October 2014 diff hist −1 Preflow-push →Induction step
- 13:5213:52, 29 October 2014 diff hist −6 Preflow-push with excess scaling →Induction basis
- 13:5113:51, 29 October 2014 diff hist +425 Preflow-push with excess scaling No edit summary
- 13:4013:40, 29 October 2014 diff hist +95 Preflow-push with excess scaling →Induction basis
- 13:3713:37, 29 October 2014 diff hist 0 Preflow-push with excess scaling →Abstract view
- 12:5912:59, 29 October 2014 diff hist +623 N Preflow-push with excess scaling Created page with "== Abstract view == '''Algorithmic problem:''' max-flow problem (standard version) '''Type of algorithm:''' loop. '''Invariant:''' Before and after ea..."
- 12:3912:39, 29 October 2014 diff hist −1 FIFO preflow-push →Complexity
- 12:3812:38, 29 October 2014 diff hist +7 FIFO preflow-push →Complexity
- 12:3812:38, 29 October 2014 diff hist +646 FIFO preflow-push →Complexity
- 11:4411:44, 29 October 2014 diff hist +105 FIFO preflow-push →Complexity
- 11:4111:41, 29 October 2014 diff hist +1 FIFO preflow-push →Complexity
- 11:4011:40, 29 October 2014 diff hist +28 FIFO preflow-push →Complexity
- 11:3711:37, 29 October 2014 diff hist −68 FIFO preflow-push →Complexity
- 11:3611:36, 29 October 2014 diff hist +66 Blocking flow by Dinic →Complexity
- 11:3311:33, 29 October 2014 diff hist +1 Blocking flow by Dinic →Complexity
- 11:3211:32, 29 October 2014 diff hist +1 Blocking flow by Dinic →Correctness
- 11:3111:31, 29 October 2014 diff hist +2 Blocking flow by Dinic →Induction step
- 11:2911:29, 29 October 2014 diff hist −9 Blocking flow by Dinic →Abstract view
- 08:3408:34, 29 October 2014 diff hist +5 Depth-first search →Correctness
- 08:3408:34, 29 October 2014 diff hist −405 Depth-first search →Correctness
- 08:3408:34, 29 October 2014 diff hist +294 Depth-first search →Correctness
- 08:2908:29, 29 October 2014 diff hist 0 Depth-first search →Induction step
- 08:2808:28, 29 October 2014 diff hist +1 Depth-first search →Induction step
- 08:2708:27, 29 October 2014 diff hist +47 Depth-first search →Induction step
- 08:2608:26, 29 October 2014 diff hist +1 Depth-first search →Induction step
- 08:2608:26, 29 October 2014 diff hist 0 Depth-first search →Induction step
- 08:2508:25, 29 October 2014 diff hist −192 Depth-first search →Induction step
- 08:2508:25, 29 October 2014 diff hist −2 Depth-first search →Induction step
- 08:2408:24, 29 October 2014 diff hist +117 Depth-first search →Induction step
- 08:1108:11, 29 October 2014 diff hist +56 Depth-first search →Induction step
27 October 2014
- 19:2019:20, 27 October 2014 diff hist +315 FIFO preflow-push →Complexity
- 18:1818:18, 27 October 2014 diff hist +151 FIFO preflow-push →Complexity
- 18:1418:14, 27 October 2014 diff hist +222 FIFO preflow-push →Complexity
- 18:1218:12, 27 October 2014 diff hist +1 FIFO preflow-push →Complexity
- 18:1218:12, 27 October 2014 diff hist +63 FIFO preflow-push →Complexity
- 18:0718:07, 27 October 2014 diff hist +228 FIFO preflow-push →Complexity
- 18:0318:03, 27 October 2014 diff hist 0 Preflow-push →Complexity
- 18:0318:03, 27 October 2014 diff hist +63 Preflow-push →Complexity
- 17:5617:56, 27 October 2014 diff hist +660 FIFO preflow-push →Abstract view
- 17:3117:31, 27 October 2014 diff hist −1 Edmonds-Karp →General Information
- 06:1206:12, 27 October 2014 diff hist +19 N FIFO preflow-push Created page with "== Abstract view =="
- 06:1206:12, 27 October 2014 diff hist +177 Max-Flow Problems No edit summary
- 06:0706:07, 27 October 2014 diff hist +1 Preflow-push →Complexity
- 06:0606:06, 27 October 2014 diff hist +124 Preflow-push →Complexity
- 06:0306:03, 27 October 2014 diff hist −3 Preflow-push →Complexity
- 06:0206:02, 27 October 2014 diff hist +193 Preflow-push →Complexity
- 05:4905:49, 27 October 2014 diff hist +1 Preflow-push →Induction step
- 05:4805:48, 27 October 2014 diff hist +620 Preflow-push →Induction step
26 October 2014
- 20:1920:19, 26 October 2014 diff hist +1,676 Preflow-push →Complexity
- 19:3419:34, 26 October 2014 diff hist +80 Preflow-push →Induction step
- 18:3118:31, 26 October 2014 diff hist +389 Preflow-push No edit summary
- 18:2518:25, 26 October 2014 diff hist +640 Preflow-push →Induction step
- 18:1218:12, 26 October 2014 diff hist +51 Preflow-push →Induction step
- 18:1218:12, 26 October 2014 diff hist +59 Preflow-push →Abstract view
- 18:1118:11, 26 October 2014 diff hist +314 Preflow-push →Induction step
- 18:0518:05, 26 October 2014 diff hist +280 Preflow-push →Induction step
- 17:1717:17, 26 October 2014 diff hist +35 Preflow-push →Induction step
- 17:1517:15, 26 October 2014 diff hist +138 Preflow-push →Abstract view
- 17:1317:13, 26 October 2014 diff hist +62 Preflow-push →Induction step
- 17:0817:08, 26 October 2014 diff hist +359 Preflow-push →Induction basis
- 17:0417:04, 26 October 2014 diff hist +46 Preflow-push →Abstract view
- 17:0317:03, 26 October 2014 diff hist 0 Preflow-push →Abstract view
- 17:0317:03, 26 October 2014 diff hist +54 Preflow-push →Abstract view
- 17:0217:02, 26 October 2014 diff hist +1 Preflow-push →Abstract view
- 17:0217:02, 26 October 2014 diff hist −1 Preflow-push →Abstract view
- 17:0117:01, 26 October 2014 diff hist 0 Preflow-push →Abstract view
- 17:0017:00, 26 October 2014 diff hist +2 Preflow-push No edit summary
- 17:0017:00, 26 October 2014 diff hist +1,226 N Preflow-push Created page with "== Abstract view == '''Algorithmic problem:''' max-flow probem (standard version) '''Type of algorithm:''' loop. '''Definition:''' # For <math>a\in A</..."
- 16:2516:25, 26 October 2014 diff hist +356 Successive shortest paths with reduced costs →Induction step
- 16:1816:18, 26 October 2014 diff hist 0 Successive shortest paths with reduced costs →Induction step
- 14:5214:52, 26 October 2014 diff hist +115 Min-cost flow problem →Negative cost factors
- 13:2213:22, 26 October 2014 diff hist +457 Min-cost flow problem No edit summary
- 13:1313:13, 26 October 2014 diff hist +531 Successive shortest paths with reduced costs →Induction step
25 October 2014
- 18:0018:00, 25 October 2014 diff hist +12 Successive shortest paths with reduced costs →Induction step
- 18:0018:00, 25 October 2014 diff hist +225 Successive shortest paths with reduced costs No edit summary
- 17:5617:56, 25 October 2014 diff hist −18 Successive shortest paths with reduced costs No edit summary
- 17:5417:54, 25 October 2014 diff hist +27 Min-cost flow problem No edit summary
- 16:0716:07, 25 October 2014 diff hist +347 Successive shortest paths with reduced costs No edit summary
- 15:5615:56, 25 October 2014 diff hist +66 Successive shortest paths →Correctness
- 15:5515:55, 25 October 2014 diff hist +1 Successive shortest paths →Correctness
- 15:5415:54, 25 October 2014 diff hist +1 Successive shortest paths →Correctness
- 15:5315:53, 25 October 2014 diff hist −318 Successive shortest paths →Correctness
- 15:5315:53, 25 October 2014 diff hist −2 Successive shortest paths →Correctness
- 15:5215:52, 25 October 2014 diff hist +126 Successive shortest paths →Correctness
- 15:5115:51, 25 October 2014 diff hist −1 Successive shortest paths →Correctness
- 15:4815:48, 25 October 2014 diff hist +736 Successive shortest paths →Correctness
- 14:2714:27, 25 October 2014 diff hist +372 Successive shortest paths →Correctness
- 14:1914:19, 25 October 2014 diff hist +5 Successive shortest paths →Correctness
- 08:3508:35, 25 October 2014 diff hist −325 Successive shortest paths →Correctness
- 08:0908:09, 25 October 2014 diff hist −68 Successive shortest paths →Correctness
- 08:0408:04, 25 October 2014 diff hist 0 Successive shortest paths →Correctness
24 October 2014
- 19:1219:12, 24 October 2014 diff hist +869 N Maximum matching by Edmonds Created page with "== Abstract view == '''Definition:''' # A path <math>p</math> in an undirected graph <math>G=(V,E)</math> is called '''alternating''' with respect to some matching <math>M</m..."
- 18:1818:18, 24 October 2014 diff hist +51 Matchings in graphs →Definitions
- 18:1718:17, 24 October 2014 diff hist +591 Matchings in graphs →Definition
- 18:1018:10, 24 October 2014 diff hist +59 Matchings in graphs →Cardinality-maximal matching
- 18:0918:09, 24 October 2014 diff hist +739 Matchings in graphs No edit summary
- 17:2617:26, 24 October 2014 diff hist +7 Successive shortest paths →Correctness
- 17:2517:25, 24 October 2014 diff hist +615 Successive shortest paths →Correctness
- 06:3206:32, 24 October 2014 diff hist +156 Successive shortest paths →Correctness
- 06:3006:30, 24 October 2014 diff hist +145 Successive shortest paths →Correctness
- 06:2806:28, 24 October 2014 diff hist +296 Successive shortest paths →Correctness
23 October 2014
- 17:5817:58, 23 October 2014 diff hist +1 Successive shortest paths with reduced costs →Abstract view
- 17:5717:57, 23 October 2014 diff hist +366 N Successive shortest paths with reduced costs Created page with "== Abstract view == '''Invariant:''' # All points of the invariant of the successive shortest paths algorithm. # For each node <math>v\in V</ma..."
- 17:4917:49, 23 October 2014 diff hist +51 Min-cost flow problem →Known Algorithms
- 17:4217:42, 23 October 2014 diff hist +500 Successive shortest paths →Correctness
- 17:3917:39, 23 October 2014 diff hist +206 Basic graph definitions →Paths
- 14:5414:54, 23 October 2014 diff hist −5 Successive shortest paths →Correctness
- 14:4314:43, 23 October 2014 diff hist +763 Successive shortest paths No edit summary
- 10:5310:53, 23 October 2014 diff hist +13 Successive shortest paths →Induction step
- 10:5310:53, 23 October 2014 diff hist +6 Successive shortest paths →Induction step
- 10:5210:52, 23 October 2014 diff hist −1 Successive shortest paths →Induction step
- 10:5010:50, 23 October 2014 diff hist +70 Successive shortest paths →Induction step
- 10:4810:48, 23 October 2014 diff hist +496 Successive shortest paths →Induction step
- 10:4010:40, 23 October 2014 diff hist +1 Successive shortest paths →Abstract view
- 10:3910:39, 23 October 2014 diff hist −3 Successive shortest paths →Abstract view
- 10:3910:39, 23 October 2014 diff hist +30 Successive shortest paths →Induction step
- 10:3510:35, 23 October 2014 diff hist +62 Successive shortest paths →Abstract view
- 10:3410:34, 23 October 2014 diff hist +1 Successive shortest paths →Abstract view
- 10:3410:34, 23 October 2014 diff hist −1 Successive shortest paths →Abstract view
- 10:3310:33, 23 October 2014 diff hist +1 Successive shortest paths →Abstract view
- 10:3310:33, 23 October 2014 diff hist 0 Successive shortest paths →Abstract view
- 10:3310:33, 23 October 2014 diff hist −151 Successive shortest paths →Abstract view
- 10:2610:26, 23 October 2014 diff hist +10 Successive shortest paths →Abstract view
- 08:5808:58, 23 October 2014 diff hist +292 Successive shortest paths No edit summary
- 08:5008:50, 23 October 2014 diff hist −1 Successive shortest paths →Abstract view
- 08:4908:49, 23 October 2014 diff hist +316 Successive shortest paths →Abstract view
- 08:0208:02, 23 October 2014 diff hist +276 Successive shortest paths No edit summary
- 07:4207:42, 23 October 2014 diff hist +1 Successive shortest paths →Abstract view
- 07:4207:42, 23 October 2014 diff hist +259 N Successive shortest paths Created page with "== Abstract view == '''Invariant:''' The capacity constraints are fulfilled. '''Variant:''' The '''balance discrepancy''' strictly decreases, that is, the value :<math>\sum_..."
22 October 2014
- 19:3419:34, 22 October 2014 diff hist +381 Negative cycle-canceling No edit summary
- 19:2219:22, 22 October 2014 diff hist 0 Negative cycle-canceling →Correctness
- 19:2119:21, 22 October 2014 diff hist +1 Negative cycle-canceling →Correctness
- 19:2019:20, 22 October 2014 diff hist +2 Negative cycle-canceling →Correctness
- 19:1919:19, 22 October 2014 diff hist +1 Negative cycle-canceling →Correctness
- 19:1819:18, 22 October 2014 diff hist +7 Negative cycle-canceling →Correctness
- 19:1019:10, 22 October 2014 diff hist +1 Negative cycle-canceling →Correctness
- 19:0919:09, 22 October 2014 diff hist +2 Negative cycle-canceling →Correctness
- 19:0919:09, 22 October 2014 diff hist +340 Negative cycle-canceling →Correctness
- 19:0019:00, 22 October 2014 diff hist +377 Negative cycle-canceling →Correctness
- 18:5518:55, 22 October 2014 diff hist +295 Negative cycle-canceling →Correctness
- 18:4918:49, 22 October 2014 diff hist +277 Negative cycle-canceling →Correctness
- 18:3618:36, 22 October 2014 diff hist +786 Negative cycle-canceling →Correctness
- 18:0718:07, 22 October 2014 diff hist +590 Negative cycle-canceling →Correctness
- 17:0217:02, 22 October 2014 diff hist +175 Negative cycle-canceling No edit summary
- 13:4913:49, 22 October 2014 diff hist +1 Negative cycle-canceling →Induction step
- 13:4913:49, 22 October 2014 diff hist +68 Negative cycle-canceling →Induction step
- 13:4813:48, 22 October 2014 diff hist +198 Negative cycle-canceling →Induction step
- 13:0013:00, 22 October 2014 diff hist +337 Negative cycle-canceling →Induction step
- 12:5612:56, 22 October 2014 diff hist +130 All pairs shortest paths →Output current
- 12:5412:54, 22 October 2014 diff hist +184 All pairs shortest paths →Output
- 12:0312:03, 22 October 2014 diff hist 0 Negative cycle-canceling →Induction step
- 11:0011:00, 22 October 2014 diff hist +36 Negative cycle-canceling →Induction step
- 10:5810:58, 22 October 2014 diff hist +120 Negative cycle-canceling →Induction step
- 10:5410:54, 22 October 2014 diff hist +17 All pairs shortest paths →Output
- 10:5410:54, 22 October 2014 diff hist −1 All pairs shortest paths →Output
- 10:5410:54, 22 October 2014 diff hist +205 All pairs shortest paths →Output
- 07:4107:41, 22 October 2014 diff hist +452 All pairs shortest paths →Ouptut
- 07:3507:35, 22 October 2014 diff hist +195 Negative cycle-canceling →Induction step
- 04:3904:39, 22 October 2014 diff hist +1 All pairs shortest paths →Known algorithms
- 04:3904:39, 22 October 2014 diff hist 0 All pairs shortest paths →Known algorithms
- 04:3804:38, 22 October 2014 diff hist +24 All pairs shortest paths No edit summary
- 04:3604:36, 22 October 2014 diff hist +1 Negative cycle-canceling →Abstract view
- 04:3304:33, 22 October 2014 diff hist +679 N Negative cycle-canceling Created page with "== Abstract view == '''Algorithmic problem:''' Min-cost flow problem '''Type of algorithm:''' loop '''Invariant:''' The flow is feasible. '''Variant:''' The cost of th..."
- 04:2204:22, 22 October 2014 diff hist +1 Min-cost flow problem →Known Algorithms
- 04:2004:20, 22 October 2014 diff hist +31 Min-cost flow problem →Known Algorithms
21 October 2014
- 16:1816:18, 21 October 2014 diff hist +56 Min-cost flow problem No edit summary
- 14:3114:31, 21 October 2014 diff hist 0 Min-cost flow problem →Output
- 14:3014:30, 21 October 2014 diff hist +8 Min-cost flow problem →Input
- 14:2914:29, 21 October 2014 diff hist −1 Min-cost flow problem →Output
- 14:2914:29, 21 October 2014 diff hist +987 N Min-cost flow problem Created page with "== Input == # A directed graph <math>G=(V,A)</math>. # For each arc <math>a\in A</math>, there are two real numbers: ## The '''upper bound''' (ak...."
20 October 2014
- 14:4014:40, 20 October 2014 diff hist +70 Index handler No edit summary
- 14:3414:34, 20 October 2014 diff hist +6 Index handler →Representation invariant
- 14:3414:34, 20 October 2014 diff hist +174 Index handler →Representation invariant
- 14:2714:27, 20 October 2014 diff hist +53 Dial implementation →Methods
- 14:2514:25, 20 October 2014 diff hist 0 Dial implementation →General information
- 14:2214:22, 20 October 2014 diff hist +2 Index handler with list of unused →Methods
- 14:2114:21, 20 October 2014 diff hist +19 Index handler with list of unused →Methods
- 14:1714:17, 20 October 2014 diff hist +4 Index handler →Method
- 14:1714:17, 20 October 2014 diff hist +1 Index handler →Method
- 14:1514:15, 20 October 2014 diff hist −1 Index handler →Method
- 14:1414:14, 20 October 2014 diff hist +211 Index handler No edit summary
- 14:0014:00, 20 October 2014 diff hist −6 Index handler with list of unused →Methods
- 14:0014:00, 20 October 2014 diff hist −13 Index handler with list of unused →Abstract view
- 13:5913:59, 20 October 2014 diff hist −9 Index handler with list of unused →Abstract view
- 13:5813:58, 20 October 2014 diff hist −708 Index handler with list of unused No edit summary
- 13:5613:56, 20 October 2014 diff hist +1 Index handler →Method
- 13:5613:56, 20 October 2014 diff hist +272 Index handler No edit summary
- 13:5313:53, 20 October 2014 diff hist +1 Index handler →Method
- 13:5213:52, 20 October 2014 diff hist +104 Index handler →Method
- 13:5213:52, 20 October 2014 diff hist +185 Index handler No edit summary
- 13:4913:49, 20 October 2014 diff hist +162 Index handler →Representation invariant
- 13:3613:36, 20 October 2014 diff hist +132 Index handler →Representation invariant
- 13:3213:32, 20 October 2014 diff hist −1,182 Index handler No edit summary
- 13:1613:16, 20 October 2014 diff hist +47 N Index handler with unused list Weihe moved page Index handler with unused list to Index handler with list of unused current
- 13:1613:16, 20 October 2014 diff hist 0 m Index handler with list of unused Weihe moved page Index handler with unused list to Index handler with list of unused
- 13:1513:15, 20 October 2014 diff hist +1,693 N Index handler with list of unused Created page with "== Abstract view == '''Abstract data structure:''' A variation of map, where: # The number of elements is bounded by some fixed positive Number..."
- 13:1513:15, 20 October 2014 diff hist 0 m Index handler Removed protection from "Index handler"
- 13:1213:12, 20 October 2014 diff hist +21 Three indians' algorithm →Induction step
- 13:1113:11, 20 October 2014 diff hist +10 Dinic →Induction step
- 13:1013:10, 20 October 2014 diff hist +14 Basic graph definitions →Subgraphs
- 13:1013:10, 20 October 2014 diff hist +576 Basic graph definitions →Subgraphs
- 13:0813:08, 20 October 2014 diff hist −66 Basic graph definitions →Subgraphs
- 13:0813:08, 20 October 2014 diff hist +1 Basic graph definitions →Subgraphs
- 13:0713:07, 20 October 2014 diff hist −4 Basic graph definitions →Subgraphs
- 13:0713:07, 20 October 2014 diff hist +744 Basic graph definitions No edit summary
- 12:5412:54, 20 October 2014 diff hist +5 Maximum branching →General information
- 12:5312:53, 20 October 2014 diff hist +2 Basic graph definitions No edit summary
- 12:5112:51, 20 October 2014 diff hist +623 Basic graph definitions No edit summary
- 12:4712:47, 20 October 2014 diff hist +45 Basic graph definitions →Cycles
- 12:4612:46, 20 October 2014 diff hist +15 Basic graph definitions →Cycles
- 12:4612:46, 20 October 2014 diff hist +84 Basic graph definitions →Cycles
- 12:4512:45, 20 October 2014 diff hist +99 Basic graph definitions No edit summary
- 12:4212:42, 20 October 2014 diff hist +21 Kosaraju No edit summary
- 12:4012:40, 20 October 2014 diff hist +11 Dijkstra →Further information
- 12:4012:40, 20 October 2014 diff hist 0 Dijkstra →Further infromation
- 12:4012:40, 20 October 2014 diff hist +10 Dijkstra No edit summary
- 12:3712:37, 20 October 2014 diff hist +1 Basic graph definitions →Transpose of a graph
- 12:3612:36, 20 October 2014 diff hist +158 Basic graph definitions No edit summary
- 12:3412:34, 20 October 2014 diff hist +2 Basic graph definitions →Paths
- 12:3312:33, 20 October 2014 diff hist +808 Basic graph definitions →Paths
- 12:2312:23, 20 October 2014 diff hist +149 Basic graph definitions No edit summary
- 12:2112:21, 20 October 2014 diff hist +48 Basic graph definitions →Connectedness
- 12:2012:20, 20 October 2014 diff hist −7 Basic graph definitions →Representations of graphs
- 12:1912:19, 20 October 2014 diff hist +5 Basic graph definitions →Representations of graphs
- 12:1912:19, 20 October 2014 diff hist +14 Basic graph definitions →Representations of graphs
- 10:4310:43, 20 October 2014 diff hist +1 Basic graph definitions →Representations of graphs
- 10:4310:43, 20 October 2014 diff hist +700 Basic graph definitions →Representations of graphs
- 10:2810:28, 20 October 2014 diff hist 0 Basic graph definitions →Adjacency, incidence, and degree
- 10:2810:28, 20 October 2014 diff hist +9 Basic graph definitions →Adjacency and incidence
- 10:2710:27, 20 October 2014 diff hist +185 Basic graph definitions →Adjacency and incidence
- 10:2510:25, 20 October 2014 diff hist +1 Basic graph definitions →= Adjacency and incidence
- 10:1710:17, 20 October 2014 diff hist 0 Basic graph definitions →Directed and undirected graphs
- 10:1010:10, 20 October 2014 diff hist +23 Basic graph definitions →Directed and undirected graphs
- 10:0910:09, 20 October 2014 diff hist +1 Basic graph definitions →Directed and undirected graphs
- 09:4809:48, 20 October 2014 diff hist −4 Basic graph definitions →Directed and undirected graphs
- 09:4709:47, 20 October 2014 diff hist +343 Basic graph definitions →Directed and undirected graphs
- 05:0505:05, 20 October 2014 diff hist +1,793 Basic graph definitions No edit summary
- 05:0205:02, 20 October 2014 diff hist +66 Blocking flow by Dinic →Correctness
- 04:4304:43, 20 October 2014 diff hist +210 Blocking flow by Dinic →Complexity
- 04:4004:40, 20 October 2014 diff hist −15 Blocking flow by Dinic →Complexity
- 04:3904:39, 20 October 2014 diff hist +30 Blocking flow by Dinic →Induction step
- 04:3904:39, 20 October 2014 diff hist +44 Blocking flow by Dinic →Induction step
- 04:3704:37, 20 October 2014 diff hist +64 Blocking flow by Dinic →Complexity
- 04:3304:33, 20 October 2014 diff hist −2 Blocking flow by Dinic →Complexity
- 04:2104:21, 20 October 2014 diff hist +92 Blocking flow by Dinic →Complexity
- 04:1904:19, 20 October 2014 diff hist 0 Ford-Fulkerson No edit summary
- 04:1804:18, 20 October 2014 diff hist 0 Ford-Fulkerson →General Information
- 04:1804:18, 20 October 2014 diff hist −1 Blocking flow by Dinic →Induction step
- 04:1804:18, 20 October 2014 diff hist +6 Blocking flow by Dinic →Induction step
- 04:1704:17, 20 October 2014 diff hist +599 Blocking flow by Dinic →Induction step
- 04:1204:12, 20 October 2014 diff hist −7 Blocking flow by Dinic →Induction step
- 04:1104:11, 20 October 2014 diff hist +7 Blocking flow by Dinic →Induction step
- 04:1104:11, 20 October 2014 diff hist +4 Blocking flow by Dinic →Induction step
- 04:1104:11, 20 October 2014 diff hist +2 Blocking flow by Dinic →Induction step
- 04:1004:10, 20 October 2014 diff hist +1 Blocking flow by Dinic →Induction step
- 04:1004:10, 20 October 2014 diff hist +966 Blocking flow by Dinic No edit summary
- 04:0104:01, 20 October 2014 diff hist +130 Graph traversal →Remarks
- 04:0004:00, 20 October 2014 diff hist +224 Graph traversal →Remarks
- 03:5303:53, 20 October 2014 diff hist +22 Graph traversal →Remarks
- 03:5103:51, 20 October 2014 diff hist +1 Blocking flow by Dinic →Abstract view
- 03:5103:51, 20 October 2014 diff hist +434 N Blocking flow by Dinic Created page with "== General information == '''Algorithmic problem:''' Blocking flow. '''Type of algorithm:''' loop. == Abstract view == '''Invariant:''' The current flow is feasible...."
- 03:4503:45, 20 October 2014 diff hist +137 Three indians' algorithm →Abstract view
- 03:4403:44, 20 October 2014 diff hist 0 Three indians' algorithm →Complexity
- 03:4203:42, 20 October 2014 diff hist −1 Three indians' algorithm →Correectness
- 03:4203:42, 20 October 2014 diff hist +11 Three indians' algorithm →Induction step
- 03:4103:41, 20 October 2014 diff hist +1,063 Three indians' algorithm No edit summary
- 03:2803:28, 20 October 2014 diff hist +294 Three indians' algorithm →Remarks
- 03:2503:25, 20 October 2014 diff hist +2 Three indians' algorithm →Induction step
- 03:2403:24, 20 October 2014 diff hist +2 Three indians' algorithm →Induction step
- 03:2403:24, 20 October 2014 diff hist +1 Three indians' algorithm →Induction step
- 03:2303:23, 20 October 2014 diff hist +27 Three indians' algorithm →Induction step
- 03:2303:23, 20 October 2014 diff hist +4 Three indians' algorithm →Induction step
- 03:2203:22, 20 October 2014 diff hist +1 Three indians' algorithm →Induction step
- 03:2203:22, 20 October 2014 diff hist +640 Three indians' algorithm →Induction step
- 03:0603:06, 20 October 2014 diff hist +18 Three indians' algorithm →Remarks
- 03:0503:05, 20 October 2014 diff hist +65 Three indians' algorithm →Induction step
- 03:0403:04, 20 October 2014 diff hist +877 Three indians' algorithm →Induction step
19 October 2014
- 21:2121:21, 19 October 2014 diff hist +49 Three indians' algorithm →Induction step
- 21:1621:16, 19 October 2014 diff hist +243 Three indians' algorithm →Induction step
- 21:0821:08, 19 October 2014 diff hist +2 Three indians' algorithm →Induction basis
- 20:5320:53, 19 October 2014 diff hist +1 Dinic →Complexity
- 20:5220:52, 19 October 2014 diff hist +1 Dinic →Complexity
- 20:5220:52, 19 October 2014 diff hist +2 Dinic →Complexity
- 20:4820:48, 19 October 2014 diff hist −1 Blocking flow →Input
- 20:4720:47, 19 October 2014 diff hist +38 Blocking flow →Input
- 20:4620:46, 19 October 2014 diff hist 0 Dinic →Induction step
- 20:4620:46, 19 October 2014 diff hist +3 Dinic →Abstract View
- 20:4520:45, 19 October 2014 diff hist +53 Dinic →General Information
- 20:4420:44, 19 October 2014 diff hist +9 Ahuja-Orlin →Remark
- 20:4420:44, 19 October 2014 diff hist +7 Ahuja-Orlin →Induction step
- 20:3320:33, 19 October 2014 diff hist +24 Ahuja-Orlin →Induction basis
- 20:3320:33, 19 October 2014 diff hist +27 Ahuja-Orlin →Induction basis
- 20:3220:32, 19 October 2014 diff hist −86 Ahuja-Orlin →Induction basis
- 20:3020:30, 19 October 2014 diff hist +7 Ahuja-Orlin →Abstract View
- 20:2920:29, 19 October 2014 diff hist +54 Ahuja-Orlin →General Information
- 19:4119:41, 19 October 2014 diff hist +1 Edmonds-Karp →Complexity
- 19:4119:41, 19 October 2014 diff hist −1 Edmonds-Karp →Complexity
- 19:4019:40, 19 October 2014 diff hist +43 Edmonds-Karp →Complexity
- 19:3719:37, 19 October 2014 diff hist +54 Edmonds-Karp →General Information
- 19:3219:32, 19 October 2014 diff hist +15 Dinic →Correctness
- 19:3119:31, 19 October 2014 diff hist +1 Ahuja-Orlin →Correctness
- 19:3119:31, 19 October 2014 diff hist +61 Ahuja-Orlin →Correctness
- 19:3019:30, 19 October 2014 diff hist +71 Edmonds-Karp No edit summary
- 19:2919:29, 19 October 2014 diff hist +56 Ford-Fulkerson →Correctness