minimum steiner tree algorithm for graph_tool
- for undirected and unweighted graph
- algorithm based on metric closure
from minimum_steiner_tree import min_steiner_tree
g = <graph_tool.Graph object>
obs = <list of ints> # the terminals
t = min_steiner_tree(g, obs) # returns a tree of type graph_tool.Graph