%%%% BRUTE FORCE n^3 approach
%	% find odd nodes that are representatives in G'n
%	[degree,loop,outEdges] = findDegree(outEdges);	% kills self-loops
%		% TODO: want to restore loops later, so as we can exploit them.
%		% probably should factor loop-deleting code out.
%	oddNodes = find(mod(degree,2)==1 & rep);
%	disp(sprintf('%d odd nodes to go.', length(oddNodes)));
%	if (length(oddNodes)==0),
%		break;
%	end
%	[allPairs,paths] = oddPairsShortest(outEdges, oddNodes);
%
%	[y,i] = min(allPairs);
%	[yy,ii] = min(y);
%	n2 = oddNodes(ii);
%	n1 = oddNodes(i(ii));
%	disp(sprintf('nodes %d and %d are %d apart, cutting path.\n', n1, n2, yy));
%	outEdges = cutPath(outEdges, n1, n2, paths(n1,:));
%	%[addrId,outEdges]