• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
Flujo maximo
 

Flujo maximo

on

  • 710 views

 

Statistics

Views

Total Views
710
Views on SlideShare
638
Embed Views
72

Actions

Likes
0
Downloads
10
Comments
0

1 Embed 72

http://investigacionoperativa01.blogspot.com 72

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Flujo maximo Flujo maximo Presentation Transcript

    • 4 5 51 3 2 40
    • 1.-Primero convertir la red dirigida en una red no dirigida 2.-Identificar los nodos origen y destino. 4 Nodo de destino 0 5 0 5Nodo origen 0 0 1 0 0 3 2 40 0
    • 3.-Identificar la capacidad mas alta que sale del nodo origen. Se elige el flujo mínimo de la ruta seleccionada K=min{α,30,20}=20 4 {20,3} 0 5 0 5 0 0{α,-} 1 0 0 3 2 40 0 {30,1}
    • Flujo mínimo 4K=min{α,30,20}=20 0 5 0 5 0 1 0 3 2 40 0
    • 5.- Repetir como si el nodo intermediario para el nodo origen. Flujo mínimoK=min{α,20,30}=20 4 0 {30,2} 5 0 5 0 1 20 {α,-} 0 3 2 40 0 {20,1}
    • Flujo mínimo K=min{α,10,20}=10 {10,1} 0 4 {20,4} 5 0 1 5 20{α,-} 20 20 3 2 40 0
    • Flujo mínimoK=min{α,10,20,10}=10 {10,3} 4 {10,4} 0 5 1 5 20 {α,-} 20 20 3 2 40 0 {10,1}
    • 4 0 5 15 20 1 20 20 2 40 3 0El flujo máximo es la sumatoria de todos los flujos mínimos encontrados K=min{α,30,20}=20 Flujo máximo encontrado K=min{α,20,30}=20 ΣK=20+20+10+10 K=min{α,10,20}=10 K=min{α,10,20,10}=10 ΣK=60