2 ms·
For representing a graph of processing nodes, none of these are great. Maybe something like DTS format used by the Linux kernel, where the language parser itsel
by megous 7y ago
For representing a graph of processing nodes, none of these are great. Maybe something like DTS format used by the Linux kernel, where the language parser itself would be able to check connections between processing nodes.
- ape4 7y agoIt took some looking but I think DTS=Device Tree Spec. https://elinux.org/Device_Tree_Usage https://elinux.org/Device_Tree_Usage