mortbopet / VSRTL

Visual Simulation of Register Transfer Logic
MIT License
88 stars 18 forks source link

add BFS placement #37

Closed mortbopet closed 5 years ago

mortbopet commented 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.

mortbopet commented 5 years ago

Implemented as ASAP scheduled placement