Version 0.10.0

Added

• New variants for the method of Schulze
• Experimental Implementation of the Ranked Pairs method

Changed

• Audited successfully Schulze with the example of Martin Schulze itself
• Various optimizations

Version 0.9.0

Added

• Ability to add options to the algorithm with getResult ()
• KemenyYoung is now able to detect its conflicts and inform through the use of an option on getResult () (see the documentation)

Changed

• Multiple bug fixes, some important (but never affecting the results).
• Code harmonization
• On the benefit of public methods provide a return value with the meaning and utility.
• Isolation of static methods having intended to be used by algorithms to avoid duplication of one another.
• Very complete (but not 100% exhaustive) examples of uses are kindly provided.
• Global code review by the author.

Version 0.8

Added

• New algorithm: Kemeny-Young (http://en.wikipedia.org/wiki/Kemeny-Young_method)

Changed

• Many internal improvements, code cleanup and improve modularity rules
• Candidates can now have long names (30 characters)

Version 0.7

Added

• Support for serialize and unserialize object.
  • Optimization of data to keep back.
  • Checking the version of the data to import.
  • WARNING : Resultat will be recalculated from voting data.

Changed

• Complete harmonization of attribute names and methods. Compatibility with old API is completely broken on the form, but the operation remains exactly the same.
• Many code cleanup and optimizations

Version 0.6

Added

• Add new Condorcet algorithm : Minimax in its three variants (Winning, Margin, Opposition | The last one is not Condorcet criterion compliant)
  http://en.wikipedia.org/wiki/Minimax_Condorcet
• Add the ability to record a new vote by using a format string like "A>B=C>D" rather than the use of an array, read the doc!

Fixed

• Some bugfix & optimizations

Version 0.5.1

Fixed

• Bugfix about registering new algorihms by an array

Version 0.5.0

Added

• Support Composer

Changed

• Important structural changes to meet the standard PSR-0, PSR-1 and PSR-2 (partial).

Version 0.4.0

Description

First version ready for production, with many API improvement and news features. And the new Condorcet Copeland method.

Version 0.3.1

Fixed

Important bugfix about caching result and add new vote.

Version 0.3.0

Description

Considerable structural changes and redesign many parts of API.
The class can now support the easy addition of new algorithms.

The next release will be devoted to validate the apparent stability of this version 0.3 and enrich the API for more flexibility. And perhaps the arrival of a new algorithm.