Package: pcSteiner 1.0.0

pcSteiner: Convenient Tool for Solving the Prize-Collecting Steiner Tree Problem

The Prize-Collecting Steiner Tree problem asks to find a subgraph connecting a given set of vertices with the most expensive nodes and least expensive edges. Since it is proven to be NP-hard, exact and efficient algorithm does not exist. This package provides convenient functionality for obtaining an approximate solution to this problem using loopy belief propagation algorithm.

Authors:Aleksei Krasikov <[email protected]>

pcSteiner_1.0.0.tar.gz
pcSteiner_1.0.0.zip(r-4.7)pcSteiner_1.0.0.zip(r-4.6)pcSteiner_1.0.0.zip(r-4.5)
pcSteiner_1.0.0.tgz(r-4.6-any)pcSteiner_1.0.0.tgz(r-4.5-any)
pcSteiner_1.0.0.tar.gz(r-4.7-any)pcSteiner_1.0.0.tar.gz(r-4.6-any)
pcSteiner_1.0.0.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
card.svg |card.png
pcSteiner/json (API)
NEWS

# Install 'pcSteiner' in R:

install.packages('pcSteiner', repos = c('https://krashkov.r-universe.dev', 'https://cloud.r-project.org'))

Bug tracker:https://github.com/krashkov/pcsteiner/issues

On CRAN:

graph-algorithms r-language steiner-tree steiner-tree-problem

4.18 score 3 stars 3 scripts 254 downloads 1 exports 11 dependencies

Last updated from:b62b9901f5. Checks:9 OK. Indexed: yes.

Target	Result	Time
linux-devel-x86_64	OK	118
source / vignettes	OK	167
linux-release-x86_64	OK	116
macos-release-arm64	OK	178
macos-oldrel-arm64	OK	152
windows-devel	OK	75
windows-release	OK	70
windows-oldrel	OK	62
wasm-release	OK	101