Topological sort: Difference between revisions
m
→{{header|Pascal}}
Line 4,547:
=={{header|Pascal}}==
======Kahn's algorithm======
This solution uses Kahn's algorithm, requires FPC version at least 3.2.0.
Line 4,708:
</pre>
======Depth-first search======
Another solution uses depth-first search and can extract the found cycle; requires FPC version at least 3.2.0.▼
▲Another solution uses
<syntaxhighlight lang="pascal">
| |||