| 词条 | Pre-topological order |
| 释义 |
In the field of computer science, a pre-topological order or pre-topological ordering of a directed graph is a linear ordering of its vertices such that if there is a directed path from vertex u to vertex v and v comes before u in the ordering, then there is also a directed path from vertex v to vertex u.[1][2] If the graph is a directed acyclic graph (DAG), topological orderings are pre-topological orderings and vice versa.[1] In other cases, any pre-topological ordering gives a partial order. References1. ^1 {{Cite book|url=https://books.google.com/books?id=mqGeSQ6dJycC|title=Combinatorial Optimization: Polyhedra and Efficiency|last=Schrijver|first=Alexander|date=2002-12-10|publisher=Springer Science & Business Media|year=|isbn=9783540443896|location=|pages=89|language=en}} {{sorting}}2. ^{{Cite web|url=http://algs4.cs.princeton.edu/42digraph/|title=Directed Graphs|last=Sedgewick|first=Robert|last2=Wayne|first2=Kevin|date=2016-09-26|website=Algorithms, 4th Edition|language=en|archive-url=|archive-date=|dead-url=|access-date=2017-09-06}} 3 : Graph algorithms|Sorting algorithms|Directed graphs |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。