tbart
1.0Teitz and Bart's p-Median Algorithm
Overview
Solves Teitz and Bart's p-median problem - given a set of points attempts to find subset of size p such that summed distances of any point in the set to the nearest point in p is minimised. Although generally effective, this algorithm does not guarantee that a globally optimal subset is found.
Install
Health
CRAN check results are not tracked yet.
Documentation
- Examples that run
- 100%
- Documented parameters
- not tracked
- Return-value docs
- not tracked
- References docs
- 13%
Downloads
Dependencies
Nothing depends on this yet.
Code & Tests
- Cyclomatic complexity
- 3.0 median / 6 max
Test coverage
Line coverage
–
Expression
–
Tests / Examples
–
Functions
29 0 exported
Complexity
2.9 avg / 6 max
Call network
29 nodes / 21 edges
Test coverage has not been measured for this package yet; nodes fall back to a neutral fill.
Call graph
Open call graph →Lowest coverage
Per-function coverage is not measured for this package yet.
People & History
3 releases. Pick two to compare their code metrics. R releases are shown for context.
- RR 4.3.0 released · 2023-04-21
- archivedRemoved from CRAN2022-07-21check issues were not corrected in time
- RR 4.2.0 released · 2022-04-22
- RR 4.1.0 released · 2021-05-18
- RR 4.0.0 released · 2020-04-24
- RR 3.6.0 released · 2019-04-26
- RR 3.5.0 released · 2018-04-23
- RR 3.4.0 released · 2017-04-21
- RR 3.3.0 released · 2016-05-03
- RR 3.2.0 released · 2015-04-16
- 1.02015-01-11 · diff ↗
- 0.9.12014-08-15 · diff ↗
- RR 3.1.0 released · 2014-04-10
- 0.92013-06-10
- RR 3.0.0 released · 2013-04-03
Package metadata
- Total releases
- 3
- License
- GPL (>= 2) OSI
- Download size
- not tracked yet
- Installed size
- not tracked yet
- With dependencies
- not tracked yet