Hi,
Can someone tell me which algorithm is used to move the oriented acyclic graph / chart as follows:
Ex. Chart nodes: A, B, C, D1, D2, D3, E
Chart boundaries: A → B, B → C, C → D1, C → D2, C → D3, D1 → E, D2 → E, D3 → E
A workaround is as follows:
A → B → C → D1, then C → D2, then C → D3,
And after that they join: D1 → E, D2 → E, D3 → E
My graph represents real-time operations. Most operations are linear, but when operations are divided by a condition, each split (for example, node C splits into D1, D2 and D3) waits for all operations to complete before they are combined (for example, nodes D1, D2 and D3 join node E)
I need to iterate over my nodes and invoke each operation in that exact order.
I use Python with pygraph, but you can use any language if you want to publish some algorithm.
Maybe this is the standard name for this algorithm, for example, depth search, Dijkstra's algorithm, Hill climbing, I don’t know? ...
Thank you so much!