通过DFG图进元件的排列执行调度和资源结合.排列出出尽量少的层数-In this assignment, you are asked to write a program that performs scheduling and resource binding for a given data flow graph (DFG) under resource constraint.

In a DFG, there are two types of operations: ADD (A) and MULTIPLY (M). The ADD operation costs 1 time unit and the MULTIPLY operation costs 2 time units.

For scheduling:

Minimize the latency under the given resource constraints.

For binding:

Based on the scheduling result, bind the operations.