Acyclic

A monosaccharide can switch from the acyclic (open-chain) form to a cyclic form, through a nucleophilic addition reaction between the carbonyl group and one of the hydroxyls of the same molecule.

An upward planar graph is a directed acyclic graph that can be drawn in the plane with its edges as non-crossing curves that are consistently oriented in an upward direction.

Biological occurrence Acyclic alkanes occur in nature in various ways.

Conversion between the furanose, acyclic, and pyranose forms of D-glucose.

Equivalently, a forest is an undirected acyclic graph.

However, specialized cases (such as bounded/integer weights, directed acyclic graphs etc.) can indeed be improved further as detailed in main.

In reality the structure is more complicated, forming a directed acyclic graph, but for many purposes "tree with merges" is an adequate approximation.

In the presence of merges, the resulting graph is no longer a tree, as nodes can have multiple parents, but is instead a rooted directed acyclic graph (DAG).

Nomenclature Although the nomenclature is not followed widely, according to IUPAC, alkenes are acyclic hydrocarbons with one double bond between carbon centers.

Not every planar directed acyclic graph is upward planar, and it is NP-complete to test whether a given graph is upward planar.

Strict partial orders are useful because they correspond more directly to directed acyclic graphs (dags): every strict partial order is a dag, and the transitive closure of a dag is both a strict partial order and also a dag itself.

The Fischer projection is a systematic way of drawing the skeletal formula of an acyclic monosaccharide so that the handedness of each chiral carbon is well specified.

The graph is acyclic since parents are always backwards in time, and rooted because there is an oldest version.

The main categories of networks are acyclic or feedforward neural networks (where the signal passes in only one direction) and recurrent neural networks (which allow feedback and short-term memories of previous input events).

The result of such compression may look similar to trying to transform the trie into a directed acyclic graph (DAG), because the reverse transform from a DAG to a trie is obvious and always possible.

Thus, a valid ordering can be described as a topological ordering of a directed acyclic graph representing occlusions between objects. citation.

Very commonly a calendar includes more than one type of cycle, or has both cyclic and acyclic elements.