Sparse matrix algorithm to solve the critical path
关键路径的稀疏矩阵求解算法

The algorithm to solve the critical path of the AOE net is generally based on the topological sort. Although this algorithm has good asymptotic time complexity (O(n e)), it is comparatively complex because the topological sort and the topological inverted sequence scanning must be carried on. An algorithm was proposed, using sparse matrix as the storage structure of the data. To prevent the critical path from being lost, the queue method was adopted for the operation. Compared with the classical algorithm, this algorithm is simple, with close asymptotic time complexity (O (n e~2/n)).