{"id":3661,"date":"2016-05-17T09:20:12","date_gmt":"2016-05-17T08:20:12","guid":{"rendered":"http:\/\/smart--grid.net\/?page_id=3661"},"modified":"2022-12-03T22:59:06","modified_gmt":"2022-12-03T21:59:06","slug":"algorithme-de-ford-fulkerson","status":"publish","type":"page","link":"https:\/\/complex-systems-ai.com\/es\/problema-de-flujo-maximo\/ford-fulkerson-algoritmo-2\/","title":{"rendered":"Algoritmo de Ford-Fulkerson"},"content":{"rendered":"<div data-elementor-type=\"wp-page\" data-elementor-id=\"3661\" class=\"elementor elementor-3661\">\n\t\t\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-6769b0a elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"6769b0a\" data-element_type=\"section\" data-e-type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-33 elementor-top-column elementor-element elementor-element-c2a6b02\" data-id=\"c2a6b02\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-79437e6 elementor-align-justify elementor-widget elementor-widget-button\" data-id=\"79437e6\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm\" href=\"https:\/\/complex-systems-ai.com\/es\/problema-de-flujo-maximo\/\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t\t\t\t<span class=\"elementor-button-text\">Problema de flujo m\u00e1ximo<\/span>\n\t\t\t\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t<div class=\"elementor-column elementor-col-33 elementor-top-column elementor-element elementor-element-a160e7d\" data-id=\"a160e7d\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-e797bca elementor-align-justify elementor-widget elementor-widget-button\" data-id=\"e797bca\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm\" href=\"https:\/\/complex-systems-ai.com\/es\/\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t\t\t\t<span class=\"elementor-button-text\">Pagina de inicio<\/span>\n\t\t\t\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t<div class=\"elementor-column elementor-col-33 elementor-top-column elementor-element elementor-element-88bdc4c\" data-id=\"88bdc4c\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-2a8b0f0 elementor-align-justify elementor-widget elementor-widget-button\" data-id=\"2a8b0f0\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm\" href=\"https:\/\/fr.wikipedia.org\/wiki\/Algorithme_de_Ford-Fulkerson\" target=\"_blank\" rel=\"noopener\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t\t\t\t<span class=\"elementor-button-text\">Wiki<\/span>\n\t\t\t\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-5594fae8 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"5594fae8\" data-element_type=\"section\" data-e-type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-6d1a8922\" data-id=\"6d1a8922\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-2ef1fe0 elementor-widget elementor-widget-text-editor\" data-id=\"2ef1fe0\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_82_2 counter-hierarchy ez-toc-counter ez-toc-grey ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title\" style=\"cursor:inherit\">Contenido<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Tabla de contenido alternativo\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Palanca<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewbox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewbox=\"0 0 24 24\" version=\"1.2\" baseprofile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/complex-systems-ai.com\/es\/problema-de-flujo-maximo\/ford-fulkerson-algoritmo-2\/#Algorithme-de-Ford-Fulkerson\" >Algoritmo de Ford-Fulkerson<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/complex-systems-ai.com\/es\/problema-de-flujo-maximo\/ford-fulkerson-algoritmo-2\/#Lalgorithme-de-Ford-Fulkerson-pas-a-pas\" >Algoritmo Ford-Fulkerson paso a paso<\/a><\/li><\/ul><\/nav><\/div>\n<h2><span class=\"ez-toc-section\" id=\"Algorithme-de-Ford-Fulkerson\"><\/span>Algoritmo de Ford-Fulkerson<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<div style=\"padding: 3px; border: 2px dotted #a5a5a5; background-color: #f6f9fa;\">El algoritmo de Ford-Fulkerson busca un camino creciente en el <a href=\"https:\/\/complex-systems-ai.com\/es\/teoria-de-grafos\/\">grafico<\/a> residual. Satura este camino si existe, de lo contrario devuelve el <a href=\"https:\/\/complex-systems-ai.com\/es\/problema-de-flujo-maximo\/\">flujo maximo<\/a>. M\u00e1s precisamente, el algoritmo establece un corte m\u00ednimo para verificar el criterio de optimalidad. Recuerde que el flujo es menor o igual que el corte.<\/div>\n\n<p>Para inicializar el algoritmo, es posible atribuir cualquier flujo en el gr\u00e1fico siguiendo rutas simples (desde la fuente hasta el sumidero). En el siguiente diagrama, hemos tomado la ruta s-2-3-t para la inicializaci\u00f3n.<\/p>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img decoding=\"async\" class=\"alignnone wp-image-3765 size-medium\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/05\/flow2-300x103.png\" alt=\"algoritmo de ford-fulkerson flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente\" width=\"300\" height=\"103\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/05\/flow2-300x103.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/05\/flow2-1024x352.png 1024w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/05\/flow2-768x264.png 768w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/05\/flow2-1200x412.png 1200w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/05\/flow2.png 1263w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/figure>\n<\/div>\n\n<div style=\"padding: 3px; border: 2px dotted #a5a5a5; background-color: #f6f9fa;\">Despu\u00e9s de la construcci\u00f3n del gr\u00e1fico residual, se elige una ruta de sa t si hay una. De lo contrario, tenemos el caudal m\u00e1ximo. En el primer caso, el nuevo flujo se calcula de acuerdo con la ruta creciente elegida en el gr\u00e1fico de desviaci\u00f3n: sumamos el flujo de la ruta creciente al flujo existente si el arco correspondiente en el gr\u00e1fico original est\u00e1 en la misma direcci\u00f3n que el de la gr\u00e1fico de desviaci\u00f3n, de lo contrario restamos el flujo El algoritmo se detiene cuando ya no hay una ruta creciente.<\/div>\n\n<p>Es posible formar un corte utilizando el \u00faltimo gr\u00e1fico de espacios. Aplicamos un camino de s, todos los v\u00e9rtices que se pueden atravesar est\u00e1n en el conjunto S, los dem\u00e1s en el conjunto T. De hecho, los arcos saturados por el flujo cortan el gr\u00e1fico en dos subconjuntos y forman el valor del corte.<\/p>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img fetchpriority=\"high\" decoding=\"async\" class=\"alignnone wp-image-3770 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/05\/cut3.png\" alt=\"flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente algoritmo ford-fulkerson\" width=\"497\" height=\"332\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/05\/cut3.png 497w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/05\/cut3-300x200.png 300w\" sizes=\"(max-width: 497px) 100vw, 497px\" \/><\/figure>\n<\/div>\n\n<p>Si desea aumentar el flujo cambiando el valor, deber\u00e1 aumentar el flujo m\u00e1ximo que puede pasar a trav\u00e9s de estos arcos.<\/p>\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Lalgorithme-de-Ford-Fulkerson-pas-a-pas\"><\/span>Algoritmo Ford-Fulkerson paso a paso<span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img decoding=\"async\" class=\"alignnone wp-image-6445 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford1.png\" alt=\"flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente algoritmo ford-fulkerson\" width=\"1009\" height=\"273\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford1.png 1009w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford1-300x81.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford1-768x208.png 768w\" sizes=\"(max-width: 1009px) 100vw, 1009px\" \/><\/figure>\n<\/div>\n\n<p>El flujo inicial es 0. Aqu\u00ed el gr\u00e1fico residual G<sub>F<\/sub> es una copia del gr\u00e1fico G. Estamos buscando una ruta de sa t, por ejemplo s-2-5-t:<\/p>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-6446 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford2.png\" alt=\"flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente algoritmo ford-fulkerson\" width=\"1013\" height=\"238\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford2.png 1013w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford2-300x70.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford2-768x180.png 768w\" sizes=\"(max-width: 1013px) 100vw, 1013px\" \/><\/figure>\n<\/div>\n\n<p>El valor m\u00ednimo de la ruta es 8. Agregamos este flujo de 8 a la ruta en el gr\u00e1fico G.<\/p>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-6447 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford3.png\" alt=\"flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente algoritmo ford-fulkerson\" width=\"963\" height=\"260\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford3.png 963w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford3-300x81.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford3-768x207.png 768w\" sizes=\"(max-width: 963px) 100vw, 963px\" \/><\/figure>\n<\/div>\n\n<p>Como recordatorio, el gr\u00e1fico residual debe mostrar los arcos inversos (que representan los flujos). El gr\u00e1fico residual de la nueva iteraci\u00f3n es el siguiente:<\/p>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-6448 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford4.png\" alt=\"flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente algoritmo ford-fulkerson\" width=\"975\" height=\"283\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford4.png 975w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford4-300x87.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford4-768x223.png 768w\" sizes=\"(max-width: 975px) 100vw, 975px\" \/><\/figure>\n<\/div>\n\n<p>Aqu\u00ed elegimos la ruta s-2-3-5-t, con 2 para el flujo de bloqueo. Cuando elegimos un arco inverso (representando as\u00ed un flujo), el nuevo flujo en el gr\u00e1fico G se reduce como se muestra en este nuevo gr\u00e1fico G.<\/p>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-6449 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford5.png\" alt=\"flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente algoritmo ford-fulkerson\" width=\"980\" height=\"265\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford5.png 980w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford5-300x81.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford5-768x208.png 768w\" sizes=\"(max-width: 980px) 100vw, 980px\" \/><\/figure>\n<\/div>\n\n<p>Valor del flujo = 10. Etc\u2026<\/p>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-6450 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford6.png\" alt=\"flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente algoritmo ford-fulkerson\" width=\"975\" height=\"294\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford6.png 975w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford6-300x90.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford6-768x232.png 768w\" sizes=\"(max-width: 975px) 100vw, 975px\" \/><\/figure>\n<\/div>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-6451 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford7.png\" alt=\"flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente algoritmo ford-fulkerson\" width=\"954\" height=\"255\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford7.png 954w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford7-300x80.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford7-768x205.png 768w\" sizes=\"(max-width: 954px) 100vw, 954px\" \/><\/figure>\n<\/div>\n\n<p>Valor de flujo = 16<\/p>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-6452 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford8.png\" alt=\"flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente algoritmo ford-fulkerson\" width=\"959\" height=\"280\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford8.png 959w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford8-300x88.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford8-768x224.png 768w\" sizes=\"(max-width: 959px) 100vw, 959px\" \/><\/figure>\n<\/div>\n\n<p>Elecci\u00f3n de arco inverso (3,2):<\/p>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-6453 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford9.png\" alt=\"flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente algoritmo ford-fulkerson\" width=\"975\" height=\"264\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford9.png 975w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford9-300x81.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford9-768x208.png 768w\" sizes=\"(max-width: 975px) 100vw, 975px\" \/><\/figure>\n<\/div>\n\n<p>Valor de flujo = 18.<\/p>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-6454 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford10.png\" alt=\"flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente algoritmo ford-fulkerson\" width=\"967\" height=\"314\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford10.png 967w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford10-300x97.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford10-768x249.png 768w\" sizes=\"(max-width: 967px) 100vw, 967px\" \/><\/figure>\n<\/div>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-6455 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford11.png\" alt=\"flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente algoritmo ford-fulkerson\" width=\"975\" height=\"267\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford11.png 975w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford11-300x82.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford11-768x210.png 768w\" sizes=\"(max-width: 975px) 100vw, 975px\" \/><\/figure>\n<\/div>\n\n<p>Valor de flujo = 19.<\/p>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-6456 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford12.png\" alt=\"flujo m\u00e1ximo problema de flujo m\u00e1ximo gr\u00e1fico de desviaci\u00f3n de corte m\u00ednimo flujo creciente algoritmo ford-fulkerson\" width=\"963\" height=\"314\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford12.png 963w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford12-300x98.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2018\/07\/ford12-768x250.png 768w\" sizes=\"(max-width: 963px) 100vw, 963px\" \/><\/figure>\n<\/div>\n\n<p>Ya no hay un camino de sa t, hemos encontrado un flujo m\u00e1ximo para este gr\u00e1fico G.<\/p>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>","protected":false},"excerpt":{"rendered":"<p>Problema de flujo m\u00e1ximo P\u00e1gina de inicio Wiki Algoritmo de Ford-Fulkerson El algoritmo de Ford-Fulkerson busca un camino creciente en el gr\u00e1fico residual. Satura este camino... <\/p>","protected":false},"author":1,"featured_media":0,"parent":3587,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-3661","page","type-page","status-publish","hentry"],"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages\/3661","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/comments?post=3661"}],"version-history":[{"count":4,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages\/3661\/revisions"}],"predecessor-version":[{"id":17928,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages\/3661\/revisions\/17928"}],"up":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages\/3587"}],"wp:attachment":[{"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/media?parent=3661"}],"curies":[{"name":"gracias","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}