Closed mortbopet closed 5 years ago
A breadth-first-search based algorithm should be implemented, wherein objects are placed based on their depth in the graph. Root node(s) should be the output port(s) of a component.
Implemented as ASAP scheduled placement
A breadth-first-search based algorithm should be implemented, wherein objects are placed based on their depth in the graph. Root node(s) should be the output port(s) of a component.