As we have seen, it becomes clearly evident that two different types of nodes appear in our exploration: and .

Let’s call the set of all :

And the set of all :

In the rest of this document, we will call any or :

We could say that:

Sets

contain (mostly and sometimes other ) and represent a form of hierarchy. For example for a given , we have:

and then can be represented by a graph:

We can build a simple hierarchical (H) relationship between the set and its items:

Concepts

relates (R) to other in a similar way. For a given , we have:

This will help establish a simple network of connectivity based on those relationships of H and R types.

we could consider also the relationship R between sets but it is quite rare (ex: 8path 3train) and is linked via concept anyway at a higher degree.

Notation

To keep thing easy to identify, we will always start the names of with a digit.

For example, the set contains 3 items:
Sensuality”, “Becoming”, “Non-Becoming”

and the concept “Path” relates to items:
“8-Fold Path”, ‘3-Fold Training”, ‘“3 Pillars”, “7 Purifications”

TODO: add exemple that contains both type as child

Note that in common literature, we call items: node or vortex. Edges are their relations (contains or relates).

Two Approches

  1. Relationship (for Concepts)

Graph Example: Vertex, edges

  1. Hierarchy (for Sets)

Graph Example: Tree like structure, children

Conclusion

We have to deal with a mix.