In graph theory, a Eulerian trail (or Eulerian path) is a trail in a graph which visits every edge exactly once.
Say, we imagine a set of things in front of us. This set could have the shape of a cloud. The members of the cloud are connected to each other. Some connections are weak, some are strong, some attract, some repel.
In absolute terms it's difficult to say what does and what does not really belong together.
It would be more adequate to speak about their associations in relative terms: some elements are more related than others.
For example, let's take a set of three:
Palindrome, Twelve, and Energy Drink.
The Energy Drink stands out for some particular criteria (possible to observe without requiring a definition of similarity). Because of this Twelve and Palindrome are automatically related, and there are negative ties to Energy Drink. Effectively three new relations have now been defined, and we have not sought refugee to seemingly unavoidable proxies such as categories, groups, tags, etc.
The complex graph of 'weighted' connections is permanently incomplete. Taxonomies ridicule: there is no map, no overview, no complete model. Every node its character is defined by it's associations. Identity is deferred. We are somewhere, we can navigate elsewhere, and the destination emerges from our move. It wasn't there before and we weren't there (…) and upon arrival its novelty fades immediately.
