from __future__ import print_function
import glob,sys,os
from collections import Counter

import dresher_LSA as d

"""This script is adapted from dresherClean_run in order to address fully 
iterated efficient trees.


next tasks: verify that novel outputs of total trees are viable trees. REMINDER, the FOR LOOP NEEDS TO BE A SUBSET OF 720 to not run forever.

Updates 12.30.2016
	Wrote runtime vars to make modifications easier, cleaned up print, write, and runtime functions and loops to remove unnecessary features.
	This version (vs. 1.8) uses a dictionary and dictionary keys to identify unique sets after analyzing, on the assumption that order functions are applied later in analysis.


Updates 09.30.2016