The term acyclic is not part of the dictionary of the Royal Spanish Academy ( RAE ). However, its use is frequent to refer to that which is not produced or developed cyclically .
The cycle
To understand what something acyclical is, therefore, you must first know what the notion of cyclical refers to. The cyclical, in turn, is linked to a cycle .
At this point, we must focus on the concept of a cycle . This idea can refer to a time period that, when it ends, is counted again; to a set of phenomena that are repeated in an orderly manner; to a series of periodic phases; or to a block or group of events or activities that maintain a certain relationship with each other.
Cyclic or acyclic sport
A cyclical sport , for example , is characterized by the development of a simple movement that ends in the same position where it started and then starts again . On the contrary, an acyclic sport is defined by the execution of alternating movements that can reach maximum intensity .
In cyclic sports there are movements in the same direction; In acyclic sports, however, changes in direction and intensity occur. Athletics is a cyclical sport, while football is an acyclical sport.
Both types of sports include activities that are beneficial for our physical and mental health, although they can be very different. Swimming , for example, is the most respected cyclical sport for its effects on our health, as it helps us tone our muscles, strengthen our respiratory system and socialize. As with almost all sports, including cyclical ones, it is accessible for beginners but very demanding for professionals . Tennis is a case of an acyclical sport that can also be played by people of all levels, giving rise to improvised matches in a park without respecting the official rules or to international championships that require training that few are capable of sustaining.
Directed acyclic graph
The expression directed acyclic graph , on the other hand, is used in mathematics and computer science to name the directed graph that lacks cycles: this means that for each vertex v there is no direct path that begins and ends at v . A graph , for its part, is a set of nodes or vertices that are linked by arcs or edges and that serve to represent binary relationships.
This concept is known by the English acronym DAG , as is the case with other concepts despite having been translated into our language. They take place in models where it is not logical for a vertex to relate to itself. For example, given an arc between a and b, indicating that b is part of a, if we were to create a cycle in the opposite direction, it would mean that a is a subset of itself and b, something that is not possible. In summary, we can say that a directed acyclic graph has a one-way flow.
In a graph of this type, the vertices are ordered following a path in which each one is always less than or equal to the next. This means that in the arc abc, a cannot be equal to c, but necessarily less. More than one directed acyclic graph can allow the production of an equal partial ordering; The one with the fewest number of arcs is called transitive reduction , while the opposite is called transitive closure .
As complementary data , we can point out that the vertex of the graph that does not have input relations is known by the name of source , while the one at the opposite end is the sink . Both must be present in a finite graph.