Solving a Prize Collecting Steiner Tree Problem in R

I would like someone to show me how to solve a Prize Collecting Steiner Tree Problem in R (implement the algorithm in R). I understand the basics of how it works, but I can't seem to code it out. More information on the data and minor requirements will be provided. I want it to take in a graph of coordinates with the prizes and costs and it should output a subgraph based on the optimal way to connect the coordinates.

I need a step by step guide on how to implement an algorithm that solves a Prize Collecting Steiner Tree problem in R. It should be an exact algorithm NOT an approximation. The algorithm should take in the name of the location and its prize. I have provided a csv file that contains the edge cost for the connection between two locations (nodes) (edge.csv) and the prize for each location (score.csv). I want the desired output to possibly be a data frame similar to desired_output.csv which shows the optimal connection path so I can match it with the coordinates and draw it on a map in the future. I am opened to any suggestions. Although I would like this to be done in R but Python is fine as well.

Can you help me do this? I can elaborate if you're confused somewhere. Thank you.

Reference material for an exact PCST problem:
https://www.ads.tuwien.ac.at/publications/bib/pdf/MPB_PCSTP.pdf

Algorithm R Programming Language

Project ID: #14864574

About the project