Chile at the 2004 Summer Olympics - Swimming - Women

Download in Excel, CSV or JSON

Structured data parsed from Wikipedia.

Data Source : WIKIPEDIA
Number of Data columns : 4 Number of Data rows : 3
Categories : economy, demography, politics, knowledge

Dataset

Data row number	Athlete	Event	Heat	Final

Download the dataset to see the full list of 3 entries

Data Columns

Name	Description	Data Type
Athlete		text
Event		text
Heat		text
Final		text

Other datasets published on Basedig

Schulze method - Example - number of voters order of prefe

From WIKIPEDIA

Structured data parsed from Wikipedia. number of voters order of preference 5 A C B E D 5 A D E C B 8 B E D A C 3 C A B E D 7 C A E B D 2 C B A D E 7 D C E B A 8 E B A D C {displaystyle {begin{array}{|c|c|}{text{number of voters}}&{text{order of preference}}hline 5&ACBED5&ADECB8&BEDAC3&CABED7&CAEBD2&CBADE7&DCEBA8&EBADCend{array}}} number of voters order of preference 5 A C B E D 5 A D E C B 8 B E D A C 3 C A B E D 7 C A E B D 2 C B A D E 7 D C E B A 8 E B A D C {displaystyle {begin{array}{|c|c|}{text{number of voters}}&{text{order of preference}}hline 5&ACBED5&ADECB8&BEDAC3&CABED7&CAEBD2&CBADE7&DCEBA8&EBADCend{array}}} number of voters order of preference 5 A C B E D 5 A D E C B 8 B E D A C 3 C A B E D 7 C A E B D 2 C B A D E 7 D C E B A 8 E B A D C {displaystyle {begin{array}{|c|c|}{text{number of voters}}&{text{order of preference}}hline 5&ACBED5&ADECB8&BEDAC3&CABED7&CAEBD2&CBADE7&DCEBA8&EBADCend{array}}} number of voters order of preference 5 A C B E D 5 A D E C B 8 B E D A C 3 C A B E D 7 C A E B D 2 C B A D E 7 D C E B A 8 E B A D C {displaystyle {begin{array}{|c|c|}{text{number of voters}}&{text{order of preference}}hline 5&ACBED5&ADECB8&BEDAC3&CABED7&CAEBD2&CBADE7&DCEBA8&EBADCend{array}}} number of voters order of preference 5 A C B E D 5 A D E C B 8 B E D A C 3 C A B E D 7 C A E B D 2 C B A D E 7 D C E B A 8 E B A D C {displaystyle {begin{array}{|c|c|}{text{number of voters}}&{text{order of preference}}hline 5&ACBED5&ADECB8&BEDAC3&CABED7&CAEBD2&CBADE7&DCEBA8&EBADCend{array}}} number of voters order of preference 5 A C B E D 5 A D E C B 8 B E D A C 3 C A B E D 7 C A E B D 2 C B A D E 7 D C E B A 8 E B A D C number of voters order of preference 5 A C B E D 5 A D E C B 8 B E D A C 3 C A B E D 7 C A E B D 2 C B A D E 7 D C E B A 8 E B A D C number of voters order of preference 5 A C B E D 5 A D E C B 8 B E D A C 3 C A B E D 7 C A E B D 2 C B A D E 7 D C E B A 8 E B A D C number of voters order of preference 5 A C B E D 5 A D E C B 8 B E D A C 3 C A B E D 7 C A E B D 2 C B A D E 7 D C E B A 8 E B A D C number of voters order of preference 5 A C B E D 5 A D E C B 8 B E D A C 3 C A B E D 7 C A E B D 2 C B A D E 7 D C E B A 8 E B A D C number of voters order of preference number of voters number of voters number of voters order of preference order of preference order of preference 5 A C B E D 5 5 A C B E D A C B E D 5 A D E C B 5 5 A D E C B A D E C B 8 B E D A C 8 8 B E D A C B E D A C 3 C A B E D 3 3 C A B E D C A B E D 7 C A E B D 7 7 C A E B D C A E B D 2 C B A D E 2 2 C B A D E C B A D E 7 D C E B A 7 7 D C E B A D C E B A 8 E B A D C 8 8 E B A D C E B A D C {displaystyle {begin{array}{|c|c|}{text{number of voters}}&{text{order of preference}}hline 5&ACBED5&ADECB8&BEDAC3&CABED7&CAEBD2&CBADE7&DCEBA8&EBADCend{array}}} The pairwise preferences have to be computed first. For example, when comparing A and B pairwise, there are 5+5+3+7=20 voters who prefer A to B, and 8+2+7+8=25 voters who prefer B to A. So d = 20 {displaystyle d=20} and d = 25 {displaystyle d=25} . The full set of pairwise preferences is: A B 5+5+3+7=20 A B 8+2+7+8=25 B A d = 20 {displaystyle d=20} d = 20 {displaystyle d=20} d = 20 {displaystyle d=20} d = 20 {displaystyle d=20} d = 20 d = 20 d = 20 {displaystyle d=20} d = 25 {displaystyle d=25} d = 25 {displaystyle d=25} d = 25 {displaystyle d=25} d = 25 {displaystyle d=25} d = 25 d = 25 d = 25 {displaystyle d=25} Matrix of pairwise preferences d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d d d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d d d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d d d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d d d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d d d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d d d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d d d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d d d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d d d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d {displaystyle d} d d d {displaystyle d} The cells for d have a light green background if d > d, otherwise the background is light red. There is no undisputed winner by only looking at the pairwise differences here. Now the strongest paths have to be identified. To help visualize the strongest paths, the set of pairwise preferences is depicted in the diagram on the right in the form of a directed graph. An arrow from the node representing a candidate X to the one representing a candidate Y is labelled with d. To avoid cluttering the diagram, an arrow has only been drawn from X to Y when d > d (i.e. the table cells with light green background), omitting the one in the opposite direction (the table cells with light red background). One example of computing the strongest path strength is p = 33: the strongest path from B to D is the direct path (B, D) which has strength 33. But when computing p, the strongest path from A to C is not the direct path (A, C) of strength 26, rather the strongest path is the indirect path (A, D, C) which has strength min(30, 28) = 28. The strength of a path is the strength of its weakest link. strength For each pair of candidates X and Y, the following table shows the strongest path from candidate X to candidate Y in red, with the weakest link underlined. underlined

voters, number, order, example, d