This PR fixes #80 by removing any vertices of degree zero from the NamedGraph output by the function steiner_tree. It also adds a test of this new behavior. (The graph already used in the previous test resulting in many degree-zero vertices so was already a good test case.)
This PR fixes #80 by removing any vertices of degree zero from the NamedGraph output by the function
steiner_tree. It also adds a test of this new behavior. (The graph already used in the previous test resulting in many degree-zero vertices so was already a good test case.)