Scribd Logo
Cargar

¡Te damos la bienvenida a Scribd!

  • Resumen Grafica Dirigida o Digrafica PDF

    Cargado por

    Yraida Artesaniamanual
    20 vistas1 página
    This document defines a directed graph or digraph (G) as a triple (V; A; γ) where V is the set of vertices, A is the set of arcs, and γ is a function that assigns an ordered pair of vertices to each arc. It notes that a digraph can be acyclic or cyclic. It then explains that the vertices are the points or nodes of the graph, the arcs are the lines that connect two vertices in a directed manner, and γ corresponds each arc e to the ordered pair <u,v> of the vertices it connects.

    Descripción original:

    Título original

    Resumen Grafica Dirigida o Digrafica.pdf

    Derechos de autor

    © © All Rights Reserved

    Formatos disponibles

    PDF, TXT o lea en línea desde Scribd

    ¿Le pareció útil este documento?

    ¿Este contenido es inapropiado?

    Denunciar este documento
    This document defines a directed graph or digraph (G) as a triple (V; A; γ) where V is the set of vertices, A is the set of arcs, and γ is a function that assigns an ordered pair of vertices to each arc. It notes that a digraph can be acyclic or cyclic. It then explains that the vertices are the points or nodes of the graph, the arcs are the lines that connect two vertices in a directed manner, and γ corresponds each arc e to the ordered pair <u,v> of the vertices it connects.

    Copyright:

    © All Rights Reserved
    Descargue como PDF, TXT o lea en línea desde Scribd
    Marcar por contenido inapropiado
    20 vistas1 página

    Resumen Grafica Dirigida o Digrafica PDF

    Cargado por

    Yraida Artesaniamanual
    This document defines a directed graph or digraph (G) as a triple (V; A; γ) where V is the set of vertices, A is the set of arcs, and γ is a function that assigns an ordered pair of vertices to each arc. It notes that a digraph can be acyclic or cyclic. It then explains that the vertices are the points or nodes of the graph, the arcs are the lines that connect two vertices in a directed manner, and γ corresponds each arc e to the ordered pair <u,v> of the vertices it connects.

    Copyright:

    © All Rights Reserved
    Descargue como PDF, TXT o lea en línea desde Scribd
    Marcar por contenido inapropiado
    de 1

    LA GRÁFICA DIRIGIDA O

    DIGRÁFICA (G)

    Terna G  V ; A;  Acíclica Cíclica

    V A 
    la Cod.0834102T
    Matemática Discreta
    Función Núcleo de Matemática aplicada
    Conjunto
    Dpto. Matemática y Física
    Decanato de Docencia
    incidencia
    Los Aristas  : AG   V G   V G  v
    vértices o arcos Etiquetado como u
    del del
    grafo grafo u al punto
    V G   AG
    Corresponder
    Etiquetado como v
    a cada
    la línea
    Elaborado por: Arista e 
    orientada
    Ing. MSc. Blanca Carvajal
    bcarvajal@unet.edu.ve que une dos e
    ordenado

    Puntos correspondiente a
    Vértices son los
    o nodos
     e  u,v 

    Grafo
    dirigido

    También podría gustarte