Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q753127> ?p ?o }
Showing triples 1 to 60 of
60
with 100 triples per page.
- Q753127 subject Q7007196.
- Q753127 subject Q7216428.
- Q753127 subject Q8269001.
- Q753127 subject Q8772745.
- Q753127 abstract "In the field of computer science, a topological sort (sometimes abbreviated 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.".
- Q753127 thumbnail Directed_acyclic_graph_2.svg?width=300.
- Q753127 wikiPageExternalLink dep-trace.
- Q753127 wikiPageExternalLink topologicalSort.html.
- Q753127 wikiPageWikiLink Q1058754.
- Q753127 wikiPageWikiLink Q1127410.
- Q753127 wikiPageWikiLink Q1137554.
- Q753127 wikiPageWikiLink Q1137726.
- Q753127 wikiPageWikiLink Q1141518.
- Q753127 wikiPageWikiLink Q11417093.
- Q753127 wikiPageWikiLink Q1141840.
- Q753127 wikiPageWikiLink Q1144915.
- Q753127 wikiPageWikiLink Q1195339.
- Q753127 wikiPageWikiLink Q1304193.
- Q753127 wikiPageWikiLink Q1361526.
- Q753127 wikiPageWikiLink Q1400910.
- Q753127 wikiPageWikiLink Q1415372.
- Q753127 wikiPageWikiLink Q166507.
- Q753127 wikiPageWikiLink Q173198.
- Q753127 wikiPageWikiLink Q17457.
- Q753127 wikiPageWikiLink Q179012.
- Q753127 wikiPageWikiLink Q183197.
- Q753127 wikiPageWikiLink Q1936134.
- Q753127 wikiPageWikiLink Q20748783.
- Q753127 wikiPageWikiLink Q21198.
- Q753127 wikiPageWikiLink Q232661.
- Q753127 wikiPageWikiLink Q2393193.
- Q753127 wikiPageWikiLink Q245595.
- Q753127 wikiPageWikiLink Q2632949.
- Q753127 wikiPageWikiLink Q273037.
- Q753127 wikiPageWikiLink Q2916352.
- Q753127 wikiPageWikiLink Q3088151.
- Q753127 wikiPageWikiLink Q333464.
- Q753127 wikiPageWikiLink Q369377.
- Q753127 wikiPageWikiLink Q4148050.
- Q753127 wikiPageWikiLink Q474715.
- Q753127 wikiPageWikiLink Q5141033.
- Q753127 wikiPageWikiLink Q523796.
- Q753127 wikiPageWikiLink Q6206757.
- Q753127 wikiPageWikiLink Q64861.
- Q753127 wikiPageWikiLink Q6505531.
- Q753127 wikiPageWikiLink Q6553442.
- Q753127 wikiPageWikiLink Q7007196.
- Q753127 wikiPageWikiLink Q7216428.
- Q753127 wikiPageWikiLink Q727035.
- Q753127 wikiPageWikiLink Q7849856.
- Q753127 wikiPageWikiLink Q786431.
- Q753127 wikiPageWikiLink Q816319.
- Q753127 wikiPageWikiLink Q82438.
- Q753127 wikiPageWikiLink Q8269001.
- Q753127 wikiPageWikiLink Q8366.
- Q753127 wikiPageWikiLink Q873428.
- Q753127 wikiPageWikiLink Q8772745.
- Q753127 comment "In the field of computer science, a topological sort (sometimes abbreviated 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.".
- Q753127 label "Topological sorting".
- Q753127 depiction Directed_acyclic_graph_2.svg.
