steiner_tree (295B)
1 # Steiner tree 2 3 Given an unordered [graph] ([graph_weighted]), and a subset of terminal vertices, find a [tree] of minimal weight that includes all the terminals 4 5 See also: [spanning_tree], [directed_steiner_forest], [feldman2006directed], [directed_steiner_network] 6 7 Up: [algorithm] on [graph]