Creating possible combinations in Matrix

Given: a square matrix with diagonal elements as infinity and the remaining all elements are numbers. Algorithm: Start from 1st row, find the lowest number among each column in 1st row. Go to the row corresponding to that column number. Repeat this process until all the rows are covered. Do not come back to 1, until every row is covered. That means the column 1 will have all infinite entries. Once a column has been visited, it should not be visited again (i.e. its cost becomes infinite) I want only experienced and proficient coders in VB6 only to bid on this one. For detailed examples, please refer to the file attached. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables): a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment. b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request. 3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement). ## Platform VB 6 only (no excel VBA or C,C++), Windows 98/2000/XP