Closest triplet takes a set of N points as input, and asks for the triplet (group of three points) that minimizes the sum of the three distances between each pair of them. https://www.spoj.com/problems/CLOSEST/
-
Notifications
You must be signed in to change notification settings - Fork 0
Closest triplet takes a set of N points as input, and asks for the triplet (group of three points) that minimizes the sum of the three distances between each pair of them. https://www.spoj.com/problems/CLOSEST/
License
CodeCat08/Algorithms-Project02-Closest-Triplet
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Closest triplet takes a set of N points as input, and asks for the triplet (group of three points) that minimizes the sum of the three distances between each pair of them. https://www.spoj.com/problems/CLOSEST/
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published