Graph data structure

Graph data structure

1. Definition

   • Set of vertices or nodes V and a set of arcs. A (1, 2).

2. It is represented with the pair

   • G = (V, A)

3. Basic Elements

   • Vertices
     • Nodes that store information
   • Bows
     • Represents the relationship between node information

4. Characteristics of graphs

   • Cycle
     • Simple closed road of length 3 or greater
   • Path
     • Sequence of n vertices that must be followed to get from the origin node to the destination node. P = (v1, ..., vn)
   • Loop
     • Edge that connects a node to itself. a = (v, v)
   • Isolated node
     • It has no edges, that is, it has grade 0, Degree (v) = 0
   • Related graph
     • If there is a simple path between two of your nodes any
   • Grafo tree
     • Graphic connected without cycles
   • Grade
     • Number of edges that contain a v (node)
   • Full graph
     • If each vertex v is adjacent to all the other than G. N vertices will have n (n-1) / 2 edges
   • Label tag
     • If your edges are assigned a value called weight or length
   • Multigram
     • If two of its vertices are connected by two edges, they receive the name of multiple or parallel edges
   • Closed way
     • If the first and last node are equal
   • Weight factor
     • Number that is assigned to the weighted edges
   • Simple way
     • If all your nodes are different, with except that the first and the last if They may be

5. Classification of graphs

   • Un Directed Graphs
     • The one whose relation between vertices is represented with a continuous line
     • It does not have an address
   • Directed Graphs
     • The one whose relation between vertices is represented with an arrow.
     • It has an address

Bilder und Dateien der Mindmap