ACADEMIC ACTIVITY IN THE LIBRARY

ACADEMIC ACTIVITY IN THE LIBRARY

1. • What is a binary tree and name its characteristics?

   • A binary tree is a finite set of elements, which is empty or divided into three separate subsets
   • The first subset contains a single element called root of the tree
   • The second subset is itself a binary tree and it is known as the left subtree of the original tree.
   • The third subset is also a binary tree and is called known as the right subtree of the original tree.

2. • What is a Graph and name its characteristics?

   • is a set of objects called vertices or nodes joined by links called edges or arcs, which allow binary relations between elements of a set to be represented
   • There are several types of graphs, we will analyze in this opportunity the best known graph schemes such as directed, undirected and labeled graphs.
   • The number of vertices that make up the graph are what we know as order

3. • A vertex in a graph. How is it understood?

   • It is understood as the fundamental unit from which the graphs are formed.
   • The vertices are like indivisible objects without properties, an example would be a semantic network, which is a graph where the vertices represent concepts or classes of objects.

4. • How are graphs classified? explain them

   • directed graph
     • consists of a set of vertices and edges where each edge is unidirectionally associated through an arrow with another.
   • undirected graph
     • are those that consist of a set of vertices that are connected to a set of edges in a non-directional way.
   • Labeled graphs
     • This classification is called labeled graphs or directed graphs with weights. This type of graphs concentrate edges that may have additional information where we can reflect names, costs, values or other data.

5. •Routes of a graph. What are they and how do they work?

   • • To traverse a data structure, the nodes must be processed one by one starting from the root node, finally visiting all of them, likewise in a graph, all reachable vertices are traversed from a given one.
     • • Steps for traversing a graph:
       • 1. The initial node is visited.
       • 2. Successor nodes are visited
       • 4. Steps 1 and 2 are repeated until a node with no outgoing or already visited arcs is found.
       • 3. The successor nodes of the successors are visited
       • 5. After visiting all the descendants of the first node and there are still more nodes to visit, then the process is repeated

6. • Representation of a graph

   • For clarity, the representation shows a Graph with 6 vertices and 7 edges

Images and files in the map