[EM] Intro to list (etc)

[eric at ericgorr.net]

At 11:48 PM -0500 10/27/03, Dave Ketchum wrote:
>Do graphs?  I am not against this, but not clear to me how to do 
>anything useful.  One thing I insist on is that stepping and winner 
>calculation SHALL be valid Condorcet operations using whatever 
>method was promised, and that the graph subroutine be restricted to 
>doing whatever is consistent with that.
>      BTW - We seem agreed on ordering candidates in one dimension 
>from winner to worst loser.

The implementation of Ranked Pairs on my site computes a final matrix 
that contains no cycles - that final matrix represents a directed 
graph and viewing it as such is something that I believe would be 
useful. I plan on doing just that at some point.

>  Just hard to see how to get to such a graph from the 2-dimension 
>results matrix (remembering that cycles make this even harder to 
>translate).

In many cases, you are correct, this is simply not possible...nor 
should it be attempted.

Does not mean the graph, allowing for easier visualization of the 
results, would not be useful.