Rare card
Topological sorting
- Value
- 50 W
- Attack
- 248
- Defence
- 198
- Players
- 0
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.
Get Topological sorting in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack