Beatpath: Difference between revisions
Content added Content deleted
imported>DCary (Create separate article for Beatpath, rather than redirecting to the Schulze method) |
imported>DCary (Fix links to examples and algorithms so they use standard capitalization) |
||
| Line 104: | Line 104: | ||
===Examples=== |
===Examples=== |
||
* [[Beatpath |
* [[Beatpath examples 3 | Examples of beatpath orders with 3 candidates]] |
||
* [[Beatpath |
* [[Beatpath example 12 | An example of a beatpath order with 12 candidates]] |
||
| Line 124: | Line 124: | ||
A version of the [http://en.wikipedia.org/wiki/Floyd-Warshall_algorithm Floyd-Warshall algorithm] can be used to identify the candidates in the maximal elements of the beatpath order or the beat-or-tie order. The Floyd-Warshall algorithm runs in Θ(N<sup>3</sup>) time. |
A version of the [http://en.wikipedia.org/wiki/Floyd-Warshall_algorithm Floyd-Warshall algorithm] can be used to identify the candidates in the maximal elements of the beatpath order or the beat-or-tie order. The Floyd-Warshall algorithm runs in Θ(N<sup>3</sup>) time. |
||
Here are [[Maximal |
Here are [[Maximal elements algorithms | pseudo-code examples of these algorithms]] applied to calculating the [[Schwartz set]] and [[Smith set]] for an election. |
||
==See also== |
==See also== |
||
* [[Beatpath |
* [[Beatpath examples 3 | Examples with 3 candidates]] |
||
* [[Beatpath |
* [[Beatpath example 12 | Example 12 candidates]] |
||
* [[Maximal elements algorithms | Algorithms to calculate the Schwartz set and Smith set]] |
* [[Maximal elements algorithms | Algorithms to calculate the Schwartz set and Smith set]] |
||
* [[Schwartz set]] |
* [[Schwartz set]] |
||