The time-constrained algorithm has time complexity of O(n 2),where n is the number of nodes in the DFG.

• 该算法的时间复杂性为O(n2 ) ；n是DFG图中的结点个数 .