Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03788354n
Noun Concept
Categories: Directed acyclic graphs, Graph algorithms, Sorting algorithms
EN
topological sorting  Algorithms for topological sorting  dependency resolution  Dependency resolver  Kahn's algorithm
EN
In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge from vertex u to vertex v, u comes before v in the ordering. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge from vertex u to vertex v, u comes before v in the ordering. Wikipedia
An ordering of the vertices of the directed graph for which each edge is directed from earlier to later in the ordering Wikidata
IS A
sort
FACET OF
graph theory
directed graph
Wikipedia
EN
topological sorting
Wikidata
EN
topological sorting
Wikipedia Redirections
EN
Algorithms for topological sorting, dependency resolution, Dependency resolver, Kahn's algorithm, Parallel algorithms for topological sorting, Top sort, topological ordering, topological sort, Toposort, Topsort

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License