google-cla[bot]
commented
1 year ago Thanks for your pull request! It looks like this may be your first contribution to a Google open source project. Before we can look at your pull request, you'll need to sign a Contributor License Agreement (CLA).
View this failed invocation of the CLA check for more information.
For the most up to date status, view the checks section at the bottom of the pull request.
The original algorithm uses multiple sorts. The new version uses the adjacency matrix to calculate the layer variable and is faster. In addition, the solution looks more readable. Let me explain the point. The first step of the algorithm is to figure out the input nodes. In an oriented graph, they have no input oriented edges. During each subsequent iteration, their neighbors are searched, together with assigning them a higher value in the layer index. If a node that has already been searched for is encountered, its value is changed anyway