You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository was archived by the owner on Jan 19, 2018. It is now read-only.
From an examination of the code in nulecule/base.py, it would appear that what is referred to as a graph is actually rendered as nested lists of lists.
The predicament this raises is the potential for the same "node" to appear multiple times in the data structure if it is a dependency of multiple other "nodes", which invariably results in an error and terminates execution when the "node" is deployed to a provider a second time.
To avoid such a predicament an acyclic hamiltonian graph is needed in place of the nested list of lists. networkx is one such library that could help with topological sorting.