| Display title | Pre-topological order |
| Default sort key | Pre-topological order |
| Page length (in bytes) | 1,368 |
| Namespace ID | 0 |
| Page ID | 212035 |
| 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>Raymond Straus |
| Date of page creation | 22:57, 6 March 2023 |
| Latest editor | imported>Raymond Straus |
| Date of latest edit | 22:57, 6 March 2023 |
| 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 the field of computer science, a pre-topological order or pre-topological ordering of a directed graph is a linear ordering of its vertices such that if there is a directed path from vertex u to vertex v and v comes before u in the ordering, then there is also a directed path from vertex v to vertex... |
