Please enable JavaScript.
Coggle requires JavaScript to display documents.
Graphs (DIRECTED GRAPHS (In an adjacency list the vertices are represented…
Graphs
-
A graph is represented by the pair:
G = (V, A)
Vertices: They are the nodes that store the information.
Arcs: Represents the relationship between the nodes, that is, the relationship between the node information
-
DIRECTED GRAPHS
In an adjacency list the vertices are represented as the main nodes of a simply linked list and the vertices with which they are related are linked in each of the vertex nodes..
REPRESENTATION:
A graph can be represented by a static implementation (adjacency matrix) or a dynamic (adjacency list).
This type of graph is characterized because edge a has an assigned address; that is, each edge is associated with an ordered pair (u, v) of nodes of G (graph).
The arcs in an adjacency matrix are represented by placing a 1 if there is an arc between vertices and a 0 if it does not exist
-
When the arcs in a graph have a weight factor, it is placed in the adjacency matrix at the intersection of the vertices that have the arc.
-
GRAPHS NOT DIRECTED.
In an adjacency list the vertices are represented as the main nodes of a list simply linked and the vertices with which they are related are linked in each of the vertex nodes, considering that the unmanaged graph has a double address
When the arcs in a graph have a weight factor, it is placed in the adjacency matrix at the intersection of the vertices that have the arc, considering that the unguided graph has two directions.
The arcs in an adjacency matrix are represented by placing a 1 if there is an arc between vertices and a 0 if it does not exist, considering that the non-directed graph has a double direction.
In an adjacency matrix, the columns and rows represent the vertices of the graph.
An unmanaged graph can also be represented statically by means of an adjacency matrix and dynamically by means of an adjacency list.
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
