Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

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.


It took some looking but I think DTS=Device Tree Spec. https://elinux.org/Device_Tree_Usage




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: