Topological sorting

Topological sorting

Uncommon

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

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 (u,v) from vertex u to vertex v, u comes before v in the ordering.

Excerpt from the Wikipedia article “Topological sorting”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Topological sorting to your collection.

Play for free

Related cards