Scribd Logo
Upload

Welcome to Scribd!

  • Define Graph

    Uploaded by

    Mirza Zaheer Ahmed
    13 views1 page
    A graph is a data structure consisting of nodes (vertices) and edges that relate the nodes to each other. A graph is represented as G=VE, where V(g) is a finite, non-empty set of vertices and E(g) is a set of edges. Graphs can be directed or undirected - undirected graphs have edges with no direction, while directed graphs have edges with a direction. Trees are a special case of graphs.

    Original Description:

    Original Title

    Define Graph.docx

    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
    A graph is a data structure consisting of nodes (vertices) and edges that relate the nodes to each other. A graph is represented as G=VE, where V(g) is a finite, non-empty set of vertices and E(g) is a set of edges. Graphs can be directed or undirected - undirected graphs have edges with no direction, while directed graphs have edges with a direction. Trees are a special case of graphs.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    13 views1 page

    Define Graph

    Uploaded by

    Mirza Zaheer Ahmed
    A graph is a data structure consisting of nodes (vertices) and edges that relate the nodes to each other. A graph is represented as G=VE, where V(g) is a finite, non-empty set of vertices and E(g) is a set of edges. Graphs can be directed or undirected - undirected graphs have edges with no direction, while directed graphs have edges with a direction. Trees are a special case of graphs.

    Copyright:

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

    Define Graph

    What Is Graphs

    A data structure that consist of set of nodes vertices and set of edges that relate the nodes of each other

    The set of describe relationship each other

    Format definition of graph

    A graph represent with G define Follow as

    G=VE

    V (g) =a finite non empty set of vector

    E (g) = set of edges

    Directed and undirected

    Undirected

    When the edges in a graph have no direction is called Undirected

    Directed

    When edges of graphs have direction is called directed

    Tree is special case of graph

    Graph terminology

    Adjacent nodes

    This node are adjacent when they connected by edges

    You might also like