Negative Compute Order

[alelievr]

Negative Compute Order

[alelievr]

Hello, the current algorithm used to compute the order is a BFS, incrementing the compute order for each compute dependecy starting from 0.
I think the way your graph was made highlight an issue with the current system, because it adds the compute order of the dependencies when you have a lot of edges as input to one node it rapidly grows.

I already planned to change the compute order of the graph to a DFS instead (for processing graph with multiple parts) that may solve your issue, I'll update the issue when I have some news

[alelievr]

So I changed the compute order in this commit: c712b28, note that the new algorithm is this one: https://en.wikipedia.org/wiki/Depth-first_search
I tried with a large graph and it indeed fixed the negative compute order issue.

If you encounter problems with the new algorithm, please let me know. Also you can revert to the old algorithm by changing

		public void UpdateComputeOrder(ComputeOrderType type = ComputeOrderType.DepthFirst)

to

		public void UpdateComputeOrder(ComputeOrderType type = ComputeOrderType.BreadthFirst)