On the shortest spanning subtree of a graph and the traveling salesman problem | Synapse