ArrayList<PartialTree.Arc> final_list = new ArrayList<PartialTree.Arc>();
		while(ptlist.size() > 1) {
			PartialTree PTX = ptlist.remove();
			MinHeap<PartialTree.Arc> PQX = PTX.getArcs();
			if(PQX.isEmpty()) //skips to next item in list
				continue;
			PartialTree.Arc arc = PQX.deleteMin();
			while(arc.v2.getRoot() == PTX.getRoot())
				arc = PQX.deleteMin();
			final_list.add(arc);
			PartialTree PTY = ptlist.removeTreeContaining(arc.v2);
			MinHeap<PartialTree.Arc> PQY;
			if(PTY != null) {
				PQY = PTY.getArcs();
				PTX.merge(PTY);
				PQX.merge(PQY);
				ptlist.append(PTX);
			}
		}

		return final_list;