Before revision:  The greatest contribution of our method is the path set in which the (n-1)! paths can be stored in O(n^2) space for a complete graph of order n.
After revision:  The greatest contribution of our method is the path set in which all the legal paths can be stored in O(n^2) space for a complete graph of order n.