Graph theory: Difference between revisions
no edit summary
No edit summary |
|||
Line 1:
Graph theory is the investigation of graphs, which shows the relationships between every pair of objects while only showing each object once within the same diagram. It is often used in the context of voting theory to discuss [[Condorcet methods]], most of which use [[Pairwise counting|pairwise counting]] to determine which candidates or groups of candidates are better than others.
== Definitions ==
Path: Also known as a walk (sometimes synonymous with chain, though not always; see [[Order theory#Definitions]]), it is when between any pair of nodes, one can go from the first node to the second by traveling through the nodes that fall "in between" (in other words, you can go from the first node to another node, to another node, to anoth... until you reach the second node). Often used when discussing [[Beatpath|beatpaths]] and the [[Schulze method]].
Strongly connected component: A portion of a graph that is strongly connected (a path can be found from any node to any other node). Often used to find the [[Smith set]] in a graph of [[Pairwise counting|pairwise relations]].
== Pairwise counting ==
| |||