The add-on is called fluxus, but shorthand flux will suffice. This add-on aims to help me understand how to build and evaluate a "directed acyclic graph" like node tree. While speed is not a primary concern, simplicity of code is. I will consider this a success if I borrow no code from anywhere, and still have a working generalized prototype.
this time i don't care about breaking stuff,
the base node set will be limited in number but comprehensive in scope.
output nodes will be numerous and dedicated to a specific purpose, refactoring late.
The add-on is called fluxus, but shorthand flux will suffice. This add-on aims to help me understand how to build and evaluate a "directed acyclic graph" like node tree. While speed is not a primary concern, simplicity of code is. I will consider this a success if I borrow no code from anywhere, and still have a working generalized prototype.
this time i don't care about breaking stuff,
bmesh.ops