Editing Topological sorting (section)

==References==
{{reflist|refs=

<ref name=Cook>{{citation
 | last = Cook | first = Stephen A. | author-link = Stephen Cook
 | title = A Taxonomy of Problems with Fast Parallel Algorithms
 | journal = Information and Control | volume = 64 | issue = 1–3
 | year = 1985 | pages = 2–22
 | doi = 10.1016/S0019-9958(85)80041-3| doi-access = free}}</ref>

<ref name=CLRS>{{citation
 | last1 = Cormen | first1 = Thomas H. | author1-link = Thomas H. Cormen
 | last2 = Leiserson | first2 = Charles E. | author2-link = Charles E. Leiserson
 | last3 = Rivest | first3 = Ronald L. | author3-link = Ronald L. Rivest
 | last4 = Stein | first4 = Clifford | author4-link = Clifford Stein
 | contribution = Section 22.4: Topological sort
 | edition = 2nd
 | isbn = 0-262-03293-7
 | pages = 549–552
 | publisher = MIT Press and McGraw-Hill
 | title = Introduction to Algorithms
 | title-link = Introduction to Algorithms | year = 2001}}</ref>

<ref name=DNS>{{citation
 | last1 = Dekel | first1 = Eliezer
 | last2 = Nassimi | first2 = David
 | last3 = Sahni | first3 = Sartaj
 | doi = 10.1137/0210049
 | issue = 4
 | journal = SIAM Journal on Computing
 | mr = 635424
 | pages = 657–675
 | title = Parallel matrix and graph algorithms
 | volume = 10
 | year = 1981}}</ref>

<ref name=Jarnagin>{{citation
 | last = Jarnagin | first = M. P.
 | title = Automatic machine methods of testing PERT networks for consistency
 | year = 1960
 | series = Technical Memorandum No. K-24/60
 | publisher = U. S. Naval Weapons Laboratory
 | location = Dahlgren, Virginia}}</ref>

<ref name=Kahn>{{citation
 | last = Kahn | first = Arthur B.
 | title = Topological sorting of large networks
 | journal = Communications of the ACM
 | volume = 5 | issue = 11 | year = 1962 | pages = 558–562
 | doi = 10.1145/368996.369025| s2cid = 16728233| doi-access = free}}</ref>

<ref name=SMDD>{{citation|last1=Sanders|first1=Peter|url=https://www.springer.com/gp/book/9783030252083|title=Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox| last2=Mehlhorn| first2=Kurt|last3=Dietzfelbinger|first3=Martin| last4=Dementiev|first4=Roman|date=2019|publisher=Springer International Publishing|isbn=978-3-030-25208-3}}</ref>

<ref name=Tarjan>{{citation
 | last = Tarjan | first = Robert E. | author-link = Robert Tarjan
 | title = Edge-disjoint spanning trees and depth-first search
 | journal = Acta Informatica | volume = 6 | issue = 2 | year = 1976 | pages = 171–185
 | doi = 10.1007/BF00268499| s2cid = 12044793 }}</ref>

<ref name=VM>{{citation
 | last1 = Vernet | first1 = Oswaldo
 | last2 = Markenzon | first2 = Lilian
 | contribution = Hamiltonian problems for reducible flowgraphs
 | title = Proceedings: 17th International Conference of the Chilean Computer Science Society
 | year = 1997
 | pages = 264–267
 | doi = 10.1109/SCCC.1997.637099| hdl = 11422/2585
 | isbn = 0-8186-8052-0
 | s2cid = 206554481
 | contribution-url = http://pantheon.ufrj.br/bitstream/11422/2585/4/02_97_000575787.pdf
 | hdl-access = free }}</ref>

}}