Category

Category uses categories and nodes to do stuff

Graphs

Node

(A)  (B)
  (C)
      (D)
(E)

Connect

(A) <- (B)
   \    ^
    _|  |
      (C)

Two way

(A) <-> (B)

How it does computing

=> #final connection, return
-> #connection

Example

(S) -> (0) => (1)
  \     ^
   _|  //
    (1)

1 -> 0
0 -> 1

Categories

Functions

Surround nodes, => (node) is return, (S) is start

Id
/————————\
|(S)->(0)|
| |   || |
| v    v |
| (1)(0) |
|  ||    |
|   v    |
|  (1)   |
\————————/
(1) -> [Id] -> (?)