Datasets:
id int64 0 4.5k | case stringclasses 3
values | grid_state stringlengths 779 8.16k | question stringlengths 46 50 | answer listlengths 1 84 | type stringclasses 1
value |
|---|---|---|---|---|---|
0 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 10 to Bus 14? | [
"Bus 10 -> Bus 9 -> Bus 14"
] | path |
1 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 12 to Bus 10? | [
"Bus 12 -> Bus 6 -> Bus 11 -> Bus 10"
] | path |
2 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 4 to Bus 5? | [
"Bus 4 -> Bus 5"
] | path |
3 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 9 to Bus 5? | [
"No path exists."
] | path |
4 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 13 to Bus 9? | [
"Bus 13 -> Bus 14 -> Bus 9"
] | path |
5 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 11 to Bus 8? | [
"Bus 11 -> Bus 10 -> Bus 9 -> Bus 7 -> Bus 8"
] | path |
6 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 7 to Bus 8? | [
"Bus 7 -> Bus 8"
] | path |
7 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 6 to Bus 8? | [
"Bus 6 -> Bus 13 -> Bus 14 -> Bus 9 -> Bus 7 -> Bus 8"
] | path |
8 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 10 to Bus 3? | [
"No path exists."
] | path |
9 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 7 to Bus 5? | [
"No path exists."
] | path |
10 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 11 to Bus 13? | [
"Bus 11 -> Bus 6 -> Bus 13"
] | path |
11 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 5 to Bus 13? | [
"No path exists."
] | path |
12 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 8 to Bus 2? | [
"No path exists."
] | path |
13 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 5 to Bus 14? | [
"No path exists."
] | path |
14 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 14 to Bus 8? | [
"Bus 14 -> Bus 9 -> Bus 7 -> Bus 8"
] | path |
15 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 10 to Bus 6? | [
"Bus 10 -> Bus 11 -> Bus 6"
] | path |
16 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 5 to Bus 14? | [
"No path exists."
] | path |
17 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 5 to Bus 7? | [
"No path exists."
] | path |
18 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 2 to Bus 8? | [
"No path exists."
] | path |
19 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 8 to Bus 13? | [
"No path exists."
] | path |
20 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 6 to Bus 7? | [
"Bus 6 -> Bus 11 -> Bus 10 -> Bus 9 -> Bus 7",
"Bus 6 -> Bus 13 -> Bus 14 -> Bus 9 -> Bus 7"
] | path |
21 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 14 to Bus 5? | [
"No path exists."
] | path |
22 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 5 to Bus 11? | [
"No path exists."
] | path |
23 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 1 to Bus 5? | [
"Bus 1 -> Bus 5"
] | path |
24 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 8 to Bus 10? | [
"Bus 8 -> Bus 7 -> Bus 9 -> Bus 10"
] | path |
25 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 2 to Bus 8? | [
"No path exists."
] | path |
26 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 5 to Bus 14? | [
"No path exists."
] | path |
27 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 7 to Bus 3? | [
"No path exists."
] | path |
28 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 3 to Bus 1? | [
"Bus 3 -> Bus 2 -> Bus 1"
] | path |
29 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 8 to Bus 9? | [
"Bus 8 -> Bus 7 -> Bus 9"
] | path |
30 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 14 to Bus 1? | [
"No path exists."
] | path |
31 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 14 to Bus 9? | [
"Bus 14 -> Bus 9"
] | path |
32 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 3 to Bus 9? | [
"No path exists."
] | path |
33 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 4 to Bus 3? | [
"Bus 4 -> Bus 3"
] | path |
34 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 1 to Bus 9? | [
"No path exists."
] | path |
35 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 10 to Bus 9? | [
"Bus 10 -> Bus 9"
] | path |
36 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 7 to Bus 13? | [
"Bus 7 -> Bus 9 -> Bus 14 -> Bus 13"
] | path |
37 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 14 to Bus 2? | [
"No path exists."
] | path |
38 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 6 to Bus 7? | [
"Bus 6 -> Bus 11 -> Bus 10 -> Bus 9 -> Bus 7",
"Bus 6 -> Bus 13 -> Bus 14 -> Bus 9 -> Bus 7"
] | path |
39 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 7 to Bus 2? | [
"No path exists."
] | path |
40 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 7 to Bus 5? | [
"No path exists."
] | path |
41 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 13 to Bus 9? | [
"Bus 13 -> Bus 14 -> Bus 9"
] | path |
42 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 5 to Bus 7? | [
"No path exists."
] | path |
43 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 10 to Bus 13? | [
"Bus 10 -> Bus 9 -> Bus 14 -> Bus 13",
"Bus 10 -> Bus 11 -> Bus 6 -> Bus 13"
] | path |
44 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 13 to Bus 2? | [
"No path exists."
] | path |
45 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 9 to Bus 3? | [
"No path exists."
] | path |
46 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 2 to Bus 14? | [
"No path exists."
] | path |
47 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 13 to Bus 1? | [
"No path exists."
] | path |
48 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 6 to Bus 1? | [
"No path exists."
] | path |
49 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 10 to Bus 6? | [
"Bus 10 -> Bus 11 -> Bus 6"
] | path |
50 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 10 to Bus 11? | [
"Bus 10 -> Bus 11"
] | path |
51 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 9 to Bus 4? | [
"No path exists."
] | path |
52 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 14 to Bus 12? | [
"Bus 14 -> Bus 13 -> Bus 12"
] | path |
53 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 4 to Bus 6? | [
"No path exists."
] | path |
54 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 6 to Bus 10? | [
"Bus 6 -> Bus 11 -> Bus 10"
] | path |
55 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 6 to Bus 7? | [
"Bus 6 -> Bus 11 -> Bus 10 -> Bus 9 -> Bus 7"
] | path |
56 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 2 to Bus 6? | [
"No path exists."
] | path |
57 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 12 to Bus 2? | [
"No path exists."
] | path |
58 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 11 to Bus 9? | [
"Bus 11 -> Bus 10 -> Bus 9"
] | path |
59 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 11 to Bus 12? | [
"Bus 11 -> Bus 6 -> Bus 12"
] | path |
60 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 10 to Bus 4? | [
"No path exists."
] | path |
61 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 14 to Bus 1? | [
"No path exists."
] | path |
62 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 5 to Bus 13? | [
"No path exists."
] | path |
63 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 4 to Bus 1? | [
"Bus 4 -> Bus 2 -> Bus 1",
"Bus 4 -> Bus 5 -> Bus 1"
] | path |
64 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 14 to Bus 12? | [
"Bus 14 -> Bus 13 -> Bus 12"
] | path |
65 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 13 to Bus 8? | [
"Bus 13 -> Bus 14 -> Bus 9 -> Bus 7 -> Bus 8"
] | path |
66 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 1 to Bus 11? | [
"No path exists."
] | path |
67 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 7 to Bus 2? | [
"No path exists."
] | path |
68 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 9 to Bus 7? | [
"Bus 9 -> Bus 7"
] | path |
69 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 9 to Bus 13? | [
"Bus 9 -> Bus 14 -> Bus 13"
] | path |
70 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 6 to Bus 13? | [
"Bus 6 -> Bus 13"
] | path |
71 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 2 to Bus 7? | [
"No path exists."
] | path |
72 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 1 to Bus 9? | [
"No path exists."
] | path |
73 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 14 to Bus 1? | [
"No path exists."
] | path |
74 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 6 to Bus 11? | [
"Bus 6 -> Bus 11"
] | path |
75 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 1 to Bus 12? | [
"No path exists."
] | path |
76 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 6 to Bus 4? | [
"No path exists."
] | path |
77 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 8 to Bus 13? | [
"Bus 8 -> Bus 7 -> Bus 9 -> Bus 10 -> Bus 11 -> Bus 6 -> Bus 13"
] | path |
78 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 10 to Bus 14? | [
"Bus 10 -> Bus 9 -> Bus 14"
] | path |
79 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 7 to Bus 11? | [
"Bus 7 -> Bus 9 -> Bus 10 -> Bus 11"
] | path |
80 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 3 to Bus 7? | [
"No path exists."
] | path |
81 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 6 to Bus 13? | [
"Bus 6 -> Bus 13"
] | path |
82 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 12 to Bus 9? | [
"Bus 12 -> Bus 13 -> Bus 14 -> Bus 9"
] | path |
83 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 12 to Bus 3? | [
"No path exists."
] | path |
84 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 6 to Bus 13? | [
"Bus 6 -> Bus 13"
] | path |
85 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 7 to Bus 14? | [
"Bus 7 -> Bus 9 -> Bus 14"
] | path |
86 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 8 to Bus 6? | [
"No path exists."
] | path |
87 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 4 to Bus 8? | [
"No path exists."
] | path |
88 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 6 to Bus 8? | [
"Bus 6 -> Bus 13 -> Bus 14 -> Bus 9 -> Bus 7 -> Bus 8"
] | path |
89 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 11 to Bus 1? | [
"No path exists."
] | path |
90 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 7 to Bus 4? | [
"No path exists."
] | path |
91 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 5 to Bus 7? | [
"No path exists."
] | path |
92 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 11 to Bus 9? | [
"Bus 11 -> Bus 10 -> Bus 9"
] | path |
93 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 9 to Bus 4? | [
"No path exists."
] | path |
94 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 4 to Bus 14? | [
"No path exists."
] | path |
95 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 3 to Bus 2? | [
"Bus 3 -> Bus 2"
] | path |
96 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 13 to Bus 1? | [
"No path exists."
] | path |
97 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 1 to Bus 5? | [
"Bus 1 -> Bus 5"
] | path |
98 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 9 to Bus 1? | [
"No path exists."
] | path |
99 | ieee14 | System: ieee14. Topology: Bus 1-Bus 2: Bus 1-Bus 2, Bus 1-Bus 5: Bus 1-Bus 5, Bus 2-Bus 3: Bus 2-Bus 3, Bus 2-Bus 4: Bus 2-Bus 4, Bus 2-Bus 5: Bus 2-Bus 5, Bus 3-Bus 4: Bus 3-Bus 4, Bus 4-Bus 5: Bus 4-Bus 5, Bus 6-Bus 11: Bus 6-Bus 11, Bus 6-Bus 12: Bus 6-Bus 12, Bus 6-Bus 13: Bus 6-Bus 13, Bus 7-Bus 8: Bus 7-Bus 8, Bu... | What is the shortest path from Bus 5 to Bus 6? | [
"No path exists."
] | path |
ORC-bench
| Task 1: Topological Path Finding | Task 2: Topological Connectivity | Task 3: Linear Power Flow |
|---|---|---|
 |
 |
 |
| Task 4: Contingency Analysis | Task 5: Power Grid Control | Task 6: Power Flow Optimization |
|---|---|---|
 |
 |
 |
Task 1: Topological Path Finding
Problem Formulation
This task assesses the spatial reasoning ability of the model by asking it to determine the shortest path between two specific buses in a given power grid state. The grid state may include modifications, such as the temporary removal of transmission lines, requiring the model to dynamically reason over the provided text-based topology rather than relying on memorized standard grid structures.
Dataset Generation
The dataset is generated using standard Institute of Electrical and Electronics Engineers (IEEE) 14, 30, and 118 bus cases. To ensure diversity and require active reasoning, up to 2 unique lines (for IEEE 14) or 5 unique lines (for larger cases) are randomly removed. A NetworkX MultiGraph is constructed using the remaining operational lines (buses can be connected by more than 1 line in IEEE 118). Two random buses are selected as the source and target. The all_shortest_paths algorithm is used to compute the valid paths. If a path exists, the ground truth is formatted as a sequence of nodes (e.g., Bus A -> Bus B -> Bus C); if none exists, the answer is No path exists.
LLM Evaluation
The LLM is provided with the textual representation of the grid topology (including the base system and any offline lines) and the query asking for the shortest path.
System Prompt:
You are a power systems expert. Provide the shortest path between the requested buses in the following format including the starting and ending buses: Bus A -> Bus B -> Bus C. If no path exists, respond with 'No path exists.' Do not provide any other text.
Performance Metrics
Performance is evaluated using an exact path-matching algorithm. To prevent false positives from partial matches (e.g., predicting “Bus 22” when the ground truth is “Bus 2”), the evaluation script enforces strict alphanumeric word boundaries when searching for the ground truth path within the model's output. The primary metric is Accuracy, computed both overall and per IEEE case.
Task 2: Topological Connectivity
Problem Formulation
This task evaluates the model's ability to deduce graph connectivity. The model must determine whether a path exists between two specific buses in a degraded power grid, effectively answering a binary “Yes” or “No” question based on the textual grid description.
Dataset Generation
Similar to Task 1a, the dataset is generated using Python and NetworkX, built upon IEEE 14, 30, and 118 bus networks. Up to 5 edges are randomly removed from the base graph to create disconnected subgraphs or alternate routes. Two random buses are sampled, and the networkx.has_path function determines the ground truth connectivity state (“Yes” or “No”). The textual prompt lists the offline lines.
LLM Evaluation
The model is prompted with the grid state and asked a direct question: “Is [Start Bus] connected to [End Bus]?” The exact system prompt used is:
You are a power systems expert. Determine if two buses are connected. Respond only with 'Yes' or 'No'. Do not provide any other text.
Performance Metrics
The metric for this task is binary Accuracy. The model's predicted response is compared against the ground truth using a case-insensitive exact match. Accuracy is reported across the entire dataset as well as per grid case.
Task 3: Linear Power Flow
Problem Formulation
This task transitions from topological to physical reasoning by asking the model to calculate the active power flow (in Megawatts [MW]) on a specific transmission line. This tests the LLM's capability to understand electrical parameters and perform implicit physical calculations or heuristics based on grid state descriptions.
Dataset Generation
The dataset is generated using Python and the PyPSA (Python for Power System Analysis) library. It uses IEEE 14, 30, and 118 bus systems. To create unique scenarios, the active power load (p_set) and generator capacities (p_nom) are randomized uniformly between 80% and 120% of their base values. A Direct Current (DC) linear power flow (LPF) is solved using PyPSA's network.lpf() solver to obtain the steady-state active power flows. A target line is randomly chosen, and its simulated flow (rounded to two decimal places) is recorded as the ground truth.
LLM Evaluation
The model is provided with the complete, randomized grid state (including node injections) and asked: “What is the active power flow (MW) on [Target Line]?” The exact system prompt used is:
You are a power systems expert. Calculate the requested physical value (e.g., Power in MW). Respond only with the numerical value. Do not provide units or any other text.
Performance Metrics
Because the output is continuous, performance is measured using Mean Absolute Error (MAE) and Root Mean Square Error (RMSE). A regular expression extracts the first floating-point number from the model's response to compare against the ground truth flow.
Task 4: Contingency Analysis
Problem Formulation
This task tests N-1 (N minus one) contingency analysis and counterfactual reasoning. Given a base grid state and a scenario describing the sudden loss of a generator or transmission line, the model must identify the transmission line most likely to overload (experience the highest flow increase) and provide a logical explanation for its choice.
Dataset Generation
The dataset is generated using PyPSA. Base flows are calculated for IEEE 14, 30, and 118 cases using the PyPSA Linear Power Flow (LPF) solver. A random N-1 contingency is applied programmatically: either a non-slack generator is tripped (output set to 0), or a transmission line is removed. The system is re-solved, and the absolute difference in line flows is calculated to find the line with the maximum spike. The dataset includes a Chain-of-Thought (CoT) answer that explains the lost element, the rerouting of power, and the identification of the overloaded line.
LLM Evaluation
The model receives the grid state and the contingency scenario. It must predict the overloaded line and justify it. The exact system prompt used is:
You are a power systems expert. Provide the line ID of the most likely overloaded transmission line in double brackets (e.g., [[L0]] for line 0) and then provide a step-by-step explanation.
Performance Metrics
The primary metric is Accuracy of identifying the correct overloaded line. Evaluation is performed by verifying if the ground truth target line string is explicitly mentioned within the predicted response.
Task 5: Power Grid Control
Problem Formulation
This task assesses the model's ability to act as a grid operator (agent). Given a set of system telemetry readings (frequency drop and voltage levels) and a sudden disturbance (e.g., wind generation drop), the model must choose the best corrective action from a multiple-choice list.
Dataset Generation
The dataset is generated using Python's standard libraries to simulate telemetry logic. For IEEE systems, 1,500 scenarios are generated representing four states: critical frequency drop, moderate frequency drop, low voltage, or stable system. Random telemetry parameters are generated within specific bounds for each state (e.g., critical frequency is between 49.0 and 49.49 Hz). Ground truth actions are deterministically mapped to the scenarios (e.g., a critical frequency drop requires spinning up a gas turbine).
LLM Evaluation
The model is prompted with the grid state, telemetry data, and four possible actions (A, B, C, D). The exact system prompt used is:
You are a power grid operator. Based on the telemetry provided, select the most appropriate control action from the given choices. Respond by providing the choice label in brackets, e.g., [B].
Performance Metrics
The metric is Accuracy, calculated by checking whether the correct textual explanation or the correct action bracket (e.g., [B]) is present within the model's lowercased prediction string.
Task 6: Optimal Power Flow Optimization
Problem Formulation
This task represents the most complex numerical reasoning challenge, assessing the model's ability to act as an end-to-end mathematical solver for the Optimal Power Flow (OPF) problem. Given a serialized heterogeneous graph representation of a power grid—including buses, loads, generators, and transmission lines—the model must compute the optimal operating state. This requires balancing complex non-linear physical constraints (Kirchhoff's laws) and operational limits (voltage bounds, generator capacities) to determine active and reactive power injections and bus voltage magnitudes and angles.
Dataset Generation
The dataset is procedurally generated using PyTorch Geometric (PyG) library. Specifically, we are curating and adapting the OPFDataset used for traditional GNN evaluation for a LLM setting. Complex grid topologies are parsed into a heterogeneous graph format, which is then serialized into structured JSON dictionaries mapping node features and edge indices. To facilitate in-context learning, few-shot prompt examples are constructed, pairing an “Example Input JSON” with its corresponding solved “Example Output JSON”.
LLM Evaluation
The model is prompted with the system instructions, the few-shot examples, and a final “Query Input JSON” that it must solve. The exact system prompt used is:
You are a powergrid operator running Optimal Power Flow simulation and you need to return a JSON formatted responses based on the provided input JSON. The input is the description of the components of the grid, including the buses, generators, loads, lines, and external grid. The output is the solution to the optimal power flow problem. You will get a few examples of Input and Output json. You need to return the correct Output for the last given Input
A robust regex-based extraction script parses the model's text output to isolate the final predicted JSON object.
Performance Metrics
Constraints: We evaluate each predicted OPF solution using three feasibility criteria. For every bus (i), we compute the active and reactive power-balance residuals
(\Delta P_i = P_i^{\mathrm{spec}} - P_i^{\mathrm{imp}}) and (\Delta Q_i = Q_i^{\mathrm{spec}} - Q_i^{\mathrm{imp}}),
where the specified injections are given by the predicted generation minus demand, and the implied injections are those induced by the predicted bus voltages under the instance topology. A bus is deemed to satisfy the power-flow equations if:[ \sqrt{\Delta P_i^2 + \Delta Qi^2} \le \varepsilon{\mathrm{pf}}. ]
Voltage feasibility is enforced via the bounds (v_i^{\min} \le \hat v_i \le v_i^{\max}), and generator feasibility via the active-power limits (P_g^{\min} \le \hat P_g \le Pg^{\max}).
For each sample, we compute the fraction of buses (or generators) that satisfy each condition, and report the dataset-level mean of these per-sample fractions. We additionally report an overall constraint satisfaction score obtained by micro-averaging all individual bus- and generator-level checks over the entire evaluation set, so that each constraint instance is weighted equally. Specifically, let (s) index evaluation samples, and let (n{\mathrm{pf}}^{(s)}), (n{\mathrm{v}}^{(s)}), and (n{\mathrm{g}}^{(s)}) denote the numbers of evaluated buses and generators for the power-flow, voltage, and generator constraints, with (n{\mathrm{pf,sat}}^{(s)}), (n{\mathrm{v,sat}}^{(s)}), and (n_{\mathrm{g,sat}}^{(s)}) the corresponding numbers satisfied.
MSE: To evaluate the numerical accuracy of the predicted OPF solutions, we compute the Mean Squared Error (MSE) between the model outputs and the ground-truth solver results in the dataset. We report the total of two components: (i) a generator MSE, calculated over each generator's active and reactive power outputs, and (ii) a bus MSE, calculated over the voltage magnitude and voltage angle at each bus. In addition to constraint satisfaction, the MSE quantifies how closely the predictions match the optimal dispatch numerically.
Valid rate: Tracks the model's ability to produce structurally correct JSON (can be parsed without raising error).
Task 7-C: Credit Scoring
Problem Formulation
This task assesses the model's ability to act as a financial expert to analyze loan application data and predict missing financial details. Given a structured tabular representation of an applicant's characteristics and loan parameters (in JSON format), the model must predict missing values such as installment, open accounts, bankruptcies, term, and various financial ratios. This evaluates the LLM's capability to reason over financial constraints and tabular data structures.
Dataset Generation
The dataset is derived from the Lending Club Loan Data (LCLD) dataset. The objective is to predict the value of a dropped column that is involved in constrained relationship with other columns. For the few-shot in-context learning evaluation, multiple context examples are selected, where each example presents an “Example Input JSON” (containing applicant and loan features) and an “Example Output JSON” (containing the target financial columns). The target variables include continuous and discrete fields.
LLM Evaluation
The model is prompted with the few-shot examples and asked to predict the target columns for a “Query Input JSON”. The exact system prompt used is:
You are a financial expert. Your task is to analyze the provided loan application data and predict the missing financial details. You need to return a JSON formatted response based on the provided input JSON. The input contains various applicant and loan characteristics. The output should contain the predicted missing values for specific fields such as installment, open accounts, bankruptcies, term, and various financial ratios. You will receive an Input JSON and you must return the correct Output JSON.
Performance Metrics
Evaluation is conducted using a constraints checker from the TabularBench framework. The primary quantitative metric is Mean Squared Error (MSE) between the predicted numerical values and the ground truth. Additionally, structural and logical validity is measured via the Constraint Satisfaction (CTR) metric, which checks if the predicted fields satisfy intrinsic tabular constraints and mathematical invariants defined by the dataset. The proportion of Invalid JSON responses is also tracked.
Task 7-U: Phishing Detection
Problem Formulation
This task tests the model's capability in cyber-security, specifically acting as an expert in phishing detection. The model is provided with characteristics extracted from a URL (e.g., in JSON format) and must predict missing security details, such as the length of the URL, number of “.com” domains, presence of HTTP in the path, ratio of digits in the URL and host, and number of redirections.
Dataset Generation
The dataset is generated from a Phishing URL tabular dataset. A structured prompt is built containing a specific number of few-shot examples. Each example splits the tabular row into an input JSON containing URL characteristics and an output JSON holding the target security fields.
LLM Evaluation
The model is evaluated on its ability to infer the missing URL characteristics from the given inputs. The exact system prompt used is:
You are a cyber-security expert in fishing detection. Your task is to analyze the provided URL data and predict the missing security details. You need to return a JSON formatted response based on the provided input JSON. The input contains various URL characteristics. The output should contain the predicted missing values for specific fields such as length_url, nb_com, http_in_path, ratio_digits_url, ratio_digits_host, and nb_redirection. You will receive an Input JSON and you must return the correct Output JSON.
Performance Metrics
The evaluation computes the Mean Squared Error (MSE) for continuous and discrete predicted URL properties. We also utilize the tabularbench constraints checker to report the Constraint Satisfaction (CTR) rate, ensuring that the model's output satisfies real-world data constraints (e.g., non-negative lengths and ratios). The Invalid JSON error rate is also measured to assess the structural formatting reliability of the LLM.
Task 7-B: BOTNET detection
Problem Formulation
This task assesses the model's proficiency in analyzing network traffic to identify botnet attacks. Acting as a cyber-security expert, the LLM analyzes a JSON representation of network traffic characteristics and must predict missing security details related to aggregated communication protocols (e.g., ICMP, UDP, TCP sums, byte flows, and durations).
Dataset Generation
The dataset is processed from the CTU-13 NERIS tabular dataset using Python and Pandas. The data is partitioned, and a series of prompt contexts are generated. Each prompt includes multiple few-shot examples (“Example Input JSON” and “Example Output JSON”), isolating target columns like icmp_sum_s_1, udp_sum_s_1, tcp_sum_s_1, and byte/packet transfer sums from the rest of the network telemetry.
LLM Evaluation
The LLM receives the prompt with few-shot network traffic examples and a target query. The exact system prompt used is:
You are a cyber-security expert in botnet attack detection. Your task is to analyze the provided network traffic data and predict the missing security details. You need to return a JSON formatted response based on the provided input JSON. The input contains various network traffic characteristics. The output should contain the predicted missing values for specific fields such as icmp_sum_s_1, udp_sum_s_1, tcp_sum_s_1, bytes_in_sum_d_2, bytes_out_sum_d_2, bytes_out_sum_s_1, pkts_out_sum_s_1, bytes_out_sum_d_3, pkts_out_sum_d_3, duration_max_d_1, and duration_max_s_OTHER. You will receive an Input JSON and you must return the correct Output JSON.
Performance Metrics
Performance is validated using the TabularBench framework. The predictions are scored using Mean Squared Error (MSE) against the ground truth ports values. A constraint satisfaction check calculates the Constraint Satisfaction (CTR) metric, which ensures that the interdependent packet and byte counts adhere to logical network constraints, alongside tracking the Invalid JSON structure rate.
- Downloads last month
- 34