| http://dbpedia.org/ontology/abstract
|
In the field of computer science, a pre-to … 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. If the graph is a directed acyclic graph (DAG), topological orderings are pre-topological orderings and vice versa. In other cases, any pre-topological ordering gives a partial order.opological ordering gives a partial order.
|
| http://dbpedia.org/ontology/wikiPageID
|
55147772
|
| http://dbpedia.org/ontology/wikiPageLength
|
1314
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1118358163
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Directed_acyclic_graph +
, http://dbpedia.org/resource/Category:Graph_algorithms +
, http://dbpedia.org/resource/Directed_graph +
, http://dbpedia.org/resource/Partial_order +
, http://dbpedia.org/resource/Linear_ordering +
, http://dbpedia.org/resource/Category:Directed_graphs +
, http://dbpedia.org/resource/Category:Sorting_algorithms +
, http://dbpedia.org/resource/Computer_science +
, http://dbpedia.org/resource/Topological_ordering +
, http://dbpedia.org/resource/Vertex_%28graph_theory%29 +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Sorting +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Sorting_algorithms +
, http://dbpedia.org/resource/Category:Directed_graphs +
, http://dbpedia.org/resource/Category:Graph_algorithms +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Pre-topological_order?oldid=1118358163&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Pre-topological_order +
|
| owl:sameAs |
http://dbpedia.org/resource/Pre-topological_order +
, http://www.wikidata.org/entity/Q39091317 +
, https://global.dbpedia.org/id/3cz4q +
|
| rdfs:comment |
In the field of computer science, a pre-to … 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. If the graph is a directed acyclic graph (DAG), topological orderings are pre-topological orderings and vice versa. In other cases, any pre-topological ordering gives a partial order.opological ordering gives a partial order.
|
| rdfs:label |
Pre-topological order
|
