トポロジカルソート
1. Topological sortingIn 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 edge uv, 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.
Read “Topological sorting” on English Wikipedia
Read “トポロジカルソート” on Japanese Wikipedia
Read “Topological sorting” on DBpedia
Read “Topological sorting” on English Wikipedia
Read “トポロジカルソート” on Japanese Wikipedia
Read “Topological sorting” on DBpedia
Discussions
Log in to talk about this word.