Java 1.4/1.5 language required. Create java code which determines if a euler tour can be made. Load a graph from a file decide whether a graph has a Euler Tour, and if it does, return a list of nodes that form a Euler Tour in another file. Euler tour: starts at an arbitrary node, goes along each edge exactly once and returns to its starting node. Hierholzers Algorithm must be used to find the Euler tour. Full specification included in zip file provided.
## Deliverables
1) Complete and fully-functional working program in executable form as well as complete source code of all work done.
2) Deliverables must be in ready-to-run condition.
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
Must be able to run on Windows XP operating system.