▍1. LPM_algorithm
用最长路径矩阵算法来计算DFG的迭代边界,其中定义了一个三维的矩阵来存储每次迭代的结果(calculate the iteration bound of DFG with the longest path matrix algorithm, defining a 3-dimention matrix to store the iteration results)
用最长路径矩阵算法来计算DFG的迭代边界,其中定义了一个三维的矩阵来存储每次迭代的结果(calculate the iteration bound of DFG with the longest path matrix algorithm, defining a 3-dimention matrix to store the iteration results)
网格划分工具箱,由美国MIT一个博士编写。可以实现二维和三维网格划分。(mesh toolbox, one from the United States, Dr. MIT. Can achieve two-and three-dimensional mesh.)