| Display title | Maximal elements algorithms |
| Default sort key | Maximal elements algorithms |
| Page length (in bytes) | 10,509 |
| Namespace ID | 0 |
| Page ID | 271 |
| 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 |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | imported>DCary |
| Date of page creation | 18:03, 9 August 2006 |
| Latest editor | Psephomancy (talk | contribs) |
| Date of latest edit | 04:13, 17 February 2020 |
| Total number of edits | 5 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
| Transcluded template (1) | Template used on this page:
|
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Versions of Kosaraju's algorithm and the Floyd-Warshall algorithm can each be used to calculate the Schwartz set and the Smith set for an election. When there are N candidates, Kosaraju's algorithm runs in Θ(N2) time with Θ(N2) space, while the Floyd-Warshall algorithm runs in Θ(N3) time with Θ(N2) space. |
