Implement the traverse of the operation tree. The implementation should act like a sort of search in the operation tree. The return value is undecided.
Linked Requirements:
( Unknown )
Potential Issues:
None
Blockers:
( None )
Issue Requirements:
Traversing the operation tree shall give all the operations coupled together.
Traversing the operation tree should be able as a tool for the user as well as used in the backend.
Worked some more on implementing the traversing, some issues remain such as cannot search backwards up input ports. Also started on writing some pytests for the module.
Rewrote the traversal to use DFS, this was dropped due to recursion not being a viable option for larger graphs. Implemented BFS instead with some help from Angus. I also wrote some basic tests. Needs more testing though. This issue can't be merged until the ID system has been implemented.
Jacob Wahlmanadded 3h 30m of time spent at 2020-02-26
Optimized the BFS a bit so now it seems to work perfectly. Added a test for looping operations. Needs more testing though. I am going to wait until the ID for operations and signals are merged to develop before continuing work on this issue.