num_nodes int64 3 9 | prompt stringclasses 7
values | output stringclasses 7
values |
|---|---|---|
3 | TSP with 3 Nodes. Total distance Minimize.
Node 0 has the distance from other nodes:
Node 1: 21
Node 2: 15
Node 1 has the distance from other nodes:
Node 0: 21
Node 2: 18
Node 2 has the distance from other nodes:
Node 0: 15
Node 1: 18 | Solution:
[0, 1, 2, 0]
Total distance: 54 |
4 | TSP with 4 Nodes. Total distance Minimize.
Node 0 has the distance from other nodes:
Node 1: 49
Node 2: 47
Node 3: 40
Node 1 has the distance from other nodes:
Node 0: 49
Node 2: 62
Node 3: 62
Node 2 has the distance from other nodes:
Node 0: 47
Node 1: 62
Node 3: 44
Node 3 has the distance from other nodes:
Node 0... | Solution:
[0, 3, 2, 1, 0]
Total distance: 195 |
5 | TSP with 5 Nodes. Total distance Minimize.
Node 0 has the distance from other nodes:
Node 1: 52
Node 2: 60
Node 3: 48
Node 4: 68
Node 1 has the distance from other nodes:
Node 0: 52
Node 2: 69
Node 3: 34
Node 4: 53
Node 2 has the distance from other nodes:
Node 0: 60
Node 1: 69
Node 3: 41
Node 4: 69
Node 3 has the ... | Solution:
[0, 4, 1, 3, 2, 0]
Total distance: 256 |
6 | TSP with 6 Nodes. Total distance Minimize.
Node 0 has the distance from other nodes:
Node 1: 61
Node 2: 57
Node 3: 66
Node 4: 66
Node 5: 35
Node 1 has the distance from other nodes:
Node 0: 61
Node 2: 38
Node 3: 40
Node 4: 31
Node 5: 47
Node 2 has the distance from other nodes:
Node 0: 57
Node 1: 38
Node 3: 59
Node ... | Solution:
[0, 5, 4, 1, 3, 2, 0]
Total distance: 279 |
7 | TSP with 7 Nodes. Total distance Minimize.
Node 0 has the distance from other nodes:
Node 1: 61
Node 2: 66
Node 3: 44
Node 4: 65
Node 5: 36
Node 6: 47
Node 1 has the distance from other nodes:
Node 0: 61
Node 2: 57
Node 3: 33
Node 4: 38
Node 5: 49
Node 6: 42
Node 2 has the distance from other nodes:
Node 0: 66
Node ... | Solution:
[0, 6, 5, 2, 4, 1, 3, 0]
Total distance: 300 |
8 | TSP with 8 Nodes. Total distance Minimize.
Node 0 has the distance from other nodes:
Node 1: 64
Node 2: 62
Node 3: 62
Node 4: 35
Node 5: 64
Node 6: 34
Node 7: 31
Node 1 has the distance from other nodes:
Node 0: 64
Node 2: 64
Node 3: 33
Node 4: 49
Node 5: 56
Node 6: 46
Node 7: 30
Node 2 has the distance from other n... | Solution:
[0, 7, 1, 3, 6, 5, 2, 4, 0]
Total distance: 311 |
9 | TSP with 9 Nodes. Total distance Minimize.
Node 0 has the distance from other nodes:
Node 1: 112
Node 2: 86
Node 3: 68
Node 4: 78
Node 5: 100
Node 6: 0
Node 7: 8
Node 8: 51
Node 1 has the distance from other nodes:
Node 0: 112
Node 2: 69
Node 3: 0
Node 4: 79
Node 5: 103
Node 6: 56
Node 7: 99
Node 8: 30
Node 2 has th... | Solution:
[0, 6, 8, 1, 3, 4, 2, 5, 7, 0]
Total distance: 111 |
No dataset card yet
- Downloads last month
- 2