private static void printTreeAndLowerAndUpperEdges() {
		int max = 5;
		if (lEdges.size() <= max) {
			for (NetworkEdge e : lEdges.values()) {
				System.out.println("In L: " + e);
			}
		} else {
			System.out.println("|L| = " + lEdges.size());
		}
		if (uEdges.size() <= max) {
			for (NetworkEdge e : uEdges.values()) {
				System.out.println("In U: " + e);
			}
		} else {
			System.out.println("|U| = " + uEdges.size());
		}
		if (tree.length <= max) {
			for (int i=1; i<tree.length; i++) {
				NetworkEdge e = tree[i];
				System.out.println("In T: " + e);
			}
			System.out.println("p: " + Arrays.toString(p));
			System.out.println("d: " + Arrays.toString(d));
			System.out.println("s: " + Arrays.toString(s));
		}
	}