Scribd Logo
Upload

Welcome to Scribd!

  • Vega Gomez Joseé Darwin: Análisis Computacional

    Uploaded by

    JoseDarwinVegaGomez
    11 views3 pages
    This document contains an analysis of the shortest routes to a computational analysis class at UNMSM (National Major University of San Marcos) in Lima, Peru. It defines a route matrix R with travel times between locations and finds the shortest path from node 1 to node 29 using graph algorithms. The shortest path is highlighted in red in a graph visualization of the routes.

    Original Description:

    Tarea06

    Original Title

    Tarea06

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains an analysis of the shortest routes to a computational analysis class at UNMSM (National Major University of San Marcos) in Lima, Peru. It defines a route matrix R with travel times between locations and finds the shortest path from node 1 to node 29 using graph algorithms. The shortest path is highlighted in red in a graph visualization of the routes.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    11 views3 pages

    Vega Gomez Joseé Darwin: Análisis Computacional

    Uploaded by

    JoseDarwinVegaGomez
    This document contains an analysis of the shortest routes to a computational analysis class at UNMSM (National Major University of San Marcos) in Lima, Peru. It defines a route matrix R with travel times between locations and finds the shortest path from node 1 to node 29 using graph algorithms. The shortest path is highlighted in red in a graph visualization of the routes.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 3

    2018

    UNMSM

    Análisis Computacional

    Vega Gomez
    Joseé Darwin
    clear all; close all; clc;
    format short g
    fprintf('VEGA GOMEZ JOSÉ D.\n')
    fprintf('_________________ \n')

    fprintf(' EJERCICIO DE RUTA CRÍTICA \n')


    fprintf(' _______________________ \n')
    fprintf(' \n')

    fprintf(' Rutas mas corta a la clase de análisis computacional


    (UNMSM)\n')
    fprintf('
    ____________________________________________________________\n')
    fprintf(' \n')

    R=[0 1.4 1 1.5 1.6 0 0 0 0 0 0 0 0 0 0 0 0


    0 0 0 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 1.8 1.9 0 0 0 2.6 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 0 1.2 2 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 0 0 1.25 1.3 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 2 2.5 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 1.6 0 0 0 4.2 0 0 0
    0 0 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 1.2 1.6 0 0 0 2.5 0 0
    0 0 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 1.7 1.3 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 1 1.5 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 1.3 0 0 0 0
    2.1 0 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0
    0 3 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1.8 1.7 0
    0 0 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2.5
    1.8 0 0 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    1.1 1.1 0 0 0 2.6 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 1.1 0 0 0 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 1.6 1.3 0 0 3.5 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 0 1.6 1.7 0 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 0 0 1.4 1.4 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 1 0 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 1.2 0 0 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 1.4 1.9 0 2.9 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 2 1 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 1.2 0 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 1.7 0 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 1.3 1.34 3.6;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 1.8 0;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 1.3;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 1.3;
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0;
    ] ;

    z=[0 0 0 0 0 0 0 0;
    0 0 5 7 12 0 0 0;
    0 0 0 0 8 15 0 0;
    0 0 0 0 3 0 19 0;
    0 0 0 0 0 6 15 0;
    0 0 0 0 0 0 7 0;
    0 0 0 0 0 0 0 19;
    0 0 0 0 0 0 0 0] ;

    h = view(biograph(R,[],'ShowArrows','on','ShowWeights','on'))

    b = sparse(R) % transforma la matriz, en una data de nodos.

    M_Path = graphallshortestpaths(b) % Matriz de la ruta mas corta

    % --------------------------------
    % dist es la distancia mas corta
    % path es la ruta mas corta
    % pred son predecesoras, de atras hacia adelante

    [dist,path,pred] = graphshortestpath(b,1,29) % Data para visualizar


    los nodo requeridos

    % script para dar color a la ruta mas corta


    % --------------------------------
    set(h.Nodes(path),'Color',[1 0.4 0.4])
    edges = getedgesbynodeid(h,get(h.Nodes(path),'ID'));
    set(edges,'LineColor',[1 0 0])
    set(edges,'LineWidth',1.5)

    You might also like