| Display title | Topological sorting |
| Default sort key | Topological sorting |
| Page length (in bytes) | 23,217 |
| Namespace ID | 0 |
| Page ID | 213078 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>LinuxGuru |
| Date of page creation | 20:27, 6 February 2024 |
| Latest editor | imported>LinuxGuru |
| Date of latest edit | 20:27, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | 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. For instance, the vertices of the graph may represent tasks to be performed, and... |
