# Multi-Directed Acyclic Graphs

Self-referential-residential-(residual)-recurrence.

In a directed acyclic graph, vertices and edges are universal connectors.

## Directed Acyclic Network

To make this more efficient (and effective) use two graphs (as in DNA) (directed-network-access) (human and universal DNA).

Meaning, in any network, you can overlay (superposition) vertices and edges, using an uber-simple (always-conserved) circle. Where a vertex and an edge articulate the underlying relationship between a circumference and a diameter (a zero and a one).

This eliminates redundancy. Which plagues all networks. Especially semantic (tokenized) networks.

## Multi-Directed Acyclic Network

Thus, to remember, all tokens are converted, eventually to one ‘zero’ and one ‘one.’ So, to improve efficiency by 100 percent, eliminate either zero or one (vertex or edge). Thus, the diagram (use the diagram as the architecture).

Where every node in any architecture is the diagram without any ‘physical’ connections. Think: connectionless (hologrammatical) network.

Meaning, the diagram does the ‘work’ (performs all of the operations) of any (every) (all) network(s). (Self-referential-residential (residual)-recursion.) Meaning, the network is a token for its tokens (nodes).

This is because Conservation of the Circle (tokenization) is the core, and, thus, the only dynamic in technology (in all of Nature).

--

--

## Ilexa Yardley

Author, The Circular Theory