Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
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