Topological Sorting

High Quality Content by WIKIPEDIA articles! In computer science, a topological sort (sometimes abbreviated topsort or toposort) or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. For instance, the vertices of the graph may represent tasks to be performed, and the edges may represent constraints that one task must be performed before another; in this application, a topological ordering is just a valid sequence for the tasks. A topological ordering is possible if and only if the graph has no directed cycles, that is, if it is a directed acyclic graph (DAG). Any DAG has at least one topological ordering, and algorithms are known for constructing a topological ordering of any DAG in linear time. Dannoe izdanie predstavlyaet soboj kompilyatsiyu svedenij, nahodyaschihsya v svobodnom dostupe v srede Internet v tselom, i v informatsionnom setevom resurse "Vikipediya" v chastnosti. Sobrannaya po chastotnym zaprosam ukazannoj tematiki, dannaya kompilyatsiya postroena po printsipu podbora blizkih informatsionnyh ssylok, ne imeet samostoyatelnogo syuzheta, ne soderzhit nikakih analiticheskih materialov, vyvodov, otsenok moralnogo, eticheskogo, politicheskogo, religioznogo i mirovozzrencheskogo haraktera v otnoshenii glavnoj tematiki, predstavlyaya soboj isklyuchitelno faktologicheskij material. This book was created using print-on-demand technology.