Introduction to trees – graph theory
In graph theory, a tree is a graph in which the vertices (v), also called nodes or points, are, in some sense, related. Each of the related pairs of nodes is called an edge (or link or line) and two nodes are connected by only one path.
In the following figure, you can see a tree where (1) is the root of the tree, 2, 3, … 7 are the nodes, and 8, 9, … 15 are the leaves. The segments that link each of the points are the edges.
Figure 9.11 – A tree graph
We have seen many cryptographic algorithms in this book. The main scope of these algorithms is related to data security. However, the main scope of the algorithms we are now approaching, also called codes, not only concerns security but also aims to preserve the information in a synthetic and usable way. This concept is related to retrieving information in the most efficient way possible. Like the problem of the bridges of Konigsberg and Eulerian...
