← Home
Prize-Collecting Steiner Tree Explorer
Build a graph, assign prizes & costs, then find the optimal subtree
Edit Mode
⬤ Add Node
— Add Edge
★ Set Prize
⚖ Set Edge Cost
✕ Delete
Node Prize / Edge Cost
Value
5
Algorithm
▶ Find PCST (Greedy)
⏭ Step Through
↺ Clear Graph
Presets
Simple (6 nodes)
3×3 Grid
Telecom Network
Result
—
total profit (prizes − costs)
Prize-Collecting Steiner Tree
Select a connected subgraph to
maximize
: sum of node prizes − sum of edge costs.
Based on
PCST-experience
research. Nodes with high prize and low-cost edges are the most attractive.
Mode: Add Node
In solution
Regular node
Excluded
Solution edge
Regular edge