Recommend this page to a friend! |
![]() ![]() |
Info | ![]() |
![]() |
![]() ![]() |
Reputation | Support forum | Blog | Links |
Last Updated | Ratings | Unique User Downloads | Download Rankings | |||||
2021-11-22 (7 months ago) ![]() | Not yet rated by the users | Total: 161 | All time: 8,853 This week: 217![]() |
Version | License | PHP version | Categories | |||
closest-pair-problem 1.0 | BSD License | 5.0 | Algorithms, PHP 5 |
Description | Author | |
This class can determine the closest pair in a set of points. |
php-solution-to-closest-pair-problem ==================================== Implements closest pair problem solution using Brute force, Divide and Conquer approach. For more information on closest pair problem visit http://en.wikipedia.org/wiki/Closest_pair_of_points_problem This class implements solution using brute force which runs as O(n2) and Divide and Conquer approach which runs as O(n log n). See example files for demo. |
Screenshots | ||
![]() |
File | Role | Description |
---|---|---|
![]() |
Class | Class source |
![]() ![]() |
Example | Example script |
![]() ![]() |
Example | Example script |
![]() ![]() |
Data | Documentation |
Version Control | Unique User Downloads | Download Rankings | |||||||||||||||
80% |
|
|
Applications that use this package |
If you know an application of this package, send a message to the author to add a link here.