fractal graph - LeFreq/Singularity GitHub Wiki

It has been argued that everything in the world can be related with a [mathematical] graph. It is a most flexible data structure, the world-wide-web being one example.

With this project, each node in the graph can be a graph itself, thereby embedding a nested graph structure for a Unified Object Model. I call this data structure a "Fractal Graph" and I contend that it can represent every complex relationship of the natural world; hence it`s employment in a data ecosystem.

The first data type to implement is the RecursiveSet. A recursive set is implemented as a kind of "meta-dict", or set-of-sets. This type allows set operations on keys and then recurses the operations between values between shared keys. This creates very sophisticated, yet compact data type that makes implementing the **graph** very simple. Each node in the set then can hold another graph, one step removed, orthogonal to that then.

This latter notion forms an abstract *grouping and decomposition model* where complex and sophisticated behaviors can emerge and I claim, that along with the probability function, is provably *optimal* for organizing relationship of any kind of data, as well as being perhaps a real contribution to computer science.