Across
- 3. In the nearest _________, it is always taking the shortest route
- 4. _______ a graph to represent the data from matrix
- 7. cycle must start and end in the ______ vertex
- 8. TSP is attributed to sir ______ Hamilton
- 9. Computing for least time by _____ the numbers assigned to the edge
- 10. similar to ________ algorithm except it must be a cycle
Down
- 1. in the brute-force method we must list down all possible ______ cycle
- 2. "always choose the _______ route"
- 5. Determine the least time ___________
- 6. TSP is about _______ the shortest hamilonian cycle