Greedy Addition Heuristic.

Modules
		netmic.algorithmic_utility netmic.network_utility networkx time

Classes
		maxFSSolver   class maxFSSolver     maxFS-style heuristic (greedily add bounds)     Methods defined here: __init__(self, N) cleanUp(self) Set list of arcs to be checked to all arcs, empty cover, remove bounds from network, it=0. solve(self, blockSize, timelimit=900) Check greedily (in blocks of size blockSize), which bounds can be added to network while maintaining feasibility. All others build cover.

Functions
		maxFSHeuristic(N, blockSize=3, timelimit=900) Return cover computed via maxFS heuristic; start with no bounds, greedily add them.