id stringlengths 15 65 | image stringlengths 42 73 ⌀ | conversations listlengths 2 2 |
|---|---|---|
topology-hard-graph1091 | data/topology/graph_visual/Base/hard/graph1091.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 35 nodes numbered from 0 to 34:\nnode 0 should be visited before node24\... |
topology-hard-graph871 | data/topology/graph_visual/Base/hard/graph871.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 33 nodes numbered from 0 to 32:\nnode 0 should be visited before node16\... |
topology-hard-graph48 | data/topology/graph_visual/Base/hard/graph48.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 26 nodes numbered from 0 to 25:\nnode 0 should be visited before node25\... |
topology-hard-graph1020 | data/topology/graph_visual/Base/hard/graph1020.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 34 nodes numbered from 0 to 33:\nnode 0 should be visited before node32\... |
topology-hard-graph497 | data/topology/graph_visual/Base/hard/graph497.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 30 nodes numbered from 0 to 29:\nnode 0 should be visited before node9\n... |
topology-hard-graph339 | data/topology/graph_visual/Base/hard/graph339.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 28 nodes numbered from 0 to 27:\nnode 0 should be visited before node18\... |
topology-hard-graph891 | data/topology/graph_visual/Base/hard/graph891.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 33 nodes numbered from 0 to 32:\nnode 0 should be visited before node27\... |
topology-hard-graph568 | data/topology/graph_visual/Base/hard/graph568.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 30 nodes numbered from 0 to 29:\nnode 0 should be visited before node13\... |
topology-hard-graph709 | data/topology/graph_visual/Base/hard/graph709.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 31 nodes numbered from 0 to 30:\nnode 1 should be visited before node9\n... |
topology-hard-graph847 | data/topology/graph_visual/Base/hard/graph847.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 33 nodes numbered from 0 to 32:\nnode 0 should be visited before node28\... |
topology-hard-graph699 | data/topology/graph_visual/Base/hard/graph699.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 31 nodes numbered from 0 to 30:\nnode 0 should be visited before node28\... |
topology-hard-graph736 | data/topology/graph_visual/Base/hard/graph736.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 32 nodes numbered from 0 to 31:\nnode 0 should be visited before node30\... |
topology-hard-graph968 | data/topology/graph_visual/Base/hard/graph968.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 34 nodes numbered from 0 to 33:\nnode 0 should be visited before node4\n... |
topology-hard-graph374 | data/topology/graph_visual/Base/hard/graph374.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 29 nodes numbered from 0 to 28:\nnode 1 should be visited before node20\... |
topology-hard-graph978 | data/topology/graph_visual/Base/hard/graph978.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 34 nodes numbered from 0 to 33:\nnode 0 should be visited before node10\... |
topology-hard-graph1125 | data/topology/graph_visual/Base/hard/graph1125.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 35 nodes numbered from 0 to 34:\nnode 0 should be visited before node6\n... |
topology-hard-graph122 | data/topology/graph_visual/Base/hard/graph122.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 27 nodes numbered from 0 to 26:\nnode 0 should be visited before node5\n... |
topology-hard-graph163 | data/topology/graph_visual/Base/hard/graph163.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 27 nodes numbered from 0 to 26:\nnode 0 should be visited before node9\n... |
topology-hard-graph783 | data/topology/graph_visual/Base/hard/graph783.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 32 nodes numbered from 0 to 31:\nnode 0 should be visited before node22\... |
topology-hard-graph633 | data/topology/graph_visual/Base/hard/graph633.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 31 nodes numbered from 0 to 30:\nnode 0 should be visited before node17\... |
topology-hard-graph1150 | data/topology/graph_visual/Base/hard/graph1150.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 35 nodes numbered from 0 to 34:\nnode 0 should be visited before node16\... |
topology-hard-graph681 | data/topology/graph_visual/Base/hard/graph681.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 31 nodes numbered from 0 to 30:\nnode 0 should be visited before node26\... |
topology-hard-graph459 | data/topology/graph_visual/Base/hard/graph459.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 29 nodes numbered from 0 to 28:\nnode 0 should be visited before node24\... |
topology-hard-graph59 | data/topology/graph_visual/Base/hard/graph59.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 26 nodes numbered from 0 to 25:\nnode 0 should be visited before node1\n... |
topology-hard-graph832 | data/topology/graph_visual/Base/hard/graph832.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 32 nodes numbered from 0 to 31:\nnode 0 should be visited before node23\... |
topology-hard-graph313 | data/topology/graph_visual/Base/hard/graph313.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 28 nodes numbered from 0 to 27:\nnode 0 should be visited before node27\... |
topology-hard-graph1046 | data/topology/graph_visual/Base/hard/graph1046.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 34 nodes numbered from 0 to 33:\nnode 0 should be visited before node8\n... |
topology-hard-graph302 | data/topology/graph_visual/Base/hard/graph302.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 28 nodes numbered from 0 to 27:\nnode 0 should be visited before node17\... |
topology-hard-graph991 | data/topology/graph_visual/Base/hard/graph991.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 34 nodes numbered from 0 to 33:\nnode 0 should be visited before node6\n... |
topology-hard-graph421 | data/topology/graph_visual/Base/hard/graph421.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 29 nodes numbered from 0 to 28:\nnode 0 should be visited before node1\n... |
topology-hard-graph805 | data/topology/graph_visual/Base/hard/graph805.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 32 nodes numbered from 0 to 31:\nnode 0 should be visited before node5\n... |
topology-hard-graph694 | data/topology/graph_visual/Base/hard/graph694.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 31 nodes numbered from 0 to 30:\nnode 0 should be visited before node11\... |
topology-hard-graph209 | data/topology/graph_visual/Base/hard/graph209.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 27 nodes numbered from 0 to 26:\nnode 1 should be visited before node15\... |
topology-hard-graph120 | data/topology/graph_visual/Base/hard/graph120.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 27 nodes numbered from 0 to 26:\nnode 0 should be visited before node18\... |
topology-hard-graph890 | data/topology/graph_visual/Base/hard/graph890.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 33 nodes numbered from 0 to 32:\nnode 0 should be visited before node6\n... |
topology-hard-graph678 | data/topology/graph_visual/Base/hard/graph678.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 31 nodes numbered from 0 to 30:\nnode 0 should be visited before node10\... |
topology-hard-graph631 | data/topology/graph_visual/Base/hard/graph631.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 31 nodes numbered from 0 to 30:\nnode 0 should be visited before node23\... |
topology-hard-graph910 | data/topology/graph_visual/Base/hard/graph910.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 33 nodes numbered from 0 to 32:\nnode 0 should be visited before node15\... |
topology-hard-graph16 | data/topology/graph_visual/Base/hard/graph16.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 26 nodes numbered from 0 to 25:\nnode 0 should be visited before node2\n... |
topology-hard-graph192 | data/topology/graph_visual/Base/hard/graph192.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 27 nodes numbered from 0 to 26:\nnode 0 should be visited before node13\... |
topology-hard-graph414 | data/topology/graph_visual/Base/hard/graph414.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 29 nodes numbered from 0 to 28:\nnode 0 should be visited before node13\... |
topology-hard-graph140 | data/topology/graph_visual/Base/hard/graph140.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 27 nodes numbered from 0 to 26:\nnode 0 should be visited before node21\... |
topology-hard-graph1053 | data/topology/graph_visual/Base/hard/graph1053.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 34 nodes numbered from 0 to 33:\nnode 0 should be visited before node2\n... |
topology-hard-graph322 | data/topology/graph_visual/Base/hard/graph322.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 28 nodes numbered from 0 to 27:\nnode 0 should be visited before node4\n... |
topology-hard-graph471 | data/topology/graph_visual/Base/hard/graph471.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 29 nodes numbered from 0 to 28:\nnode 0 should be visited before node14\... |
topology-hard-graph224 | data/topology/graph_visual/Base/hard/graph224.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 27 nodes numbered from 0 to 26:\nnode 0 should be visited before node16\... |
topology-hard-graph1099 | data/topology/graph_visual/Base/hard/graph1099.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 35 nodes numbered from 0 to 34:\nnode 0 should be visited before node23\... |
topology-hard-graph938 | data/topology/graph_visual/Base/hard/graph938.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 33 nodes numbered from 0 to 32:\nnode 0 should be visited before node12\... |
topology-hard-graph448 | data/topology/graph_visual/Base/hard/graph448.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 29 nodes numbered from 0 to 28:\nnode 0 should be visited before node8\n... |
topology-hard-graph827 | data/topology/graph_visual/Base/hard/graph827.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 32 nodes numbered from 0 to 31:\nnode 0 should be visited before node28\... |
topology-hard-graph492 | data/topology/graph_visual/Base/hard/graph492.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 30 nodes numbered from 0 to 29:\nnode 0 should be visited before node2\n... |
topology-hard-graph955 | data/topology/graph_visual/Base/hard/graph955.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 33 nodes numbered from 0 to 32:\nnode 1 should be visited before node7\n... |
topology-hard-graph98 | data/topology/graph_visual/Base/hard/graph98.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 26 nodes numbered from 0 to 25:\nnode 0 should be visited before node4\n... |
topology-hard-graph504 | data/topology/graph_visual/Base/hard/graph504.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 30 nodes numbered from 0 to 29:\nnode 0 should be visited before node20\... |
topology-hard-graph26 | data/topology/graph_visual/Base/hard/graph26.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 26 nodes numbered from 0 to 25:\nnode 0 should be visited before node11\... |
topology-hard-graph307 | data/topology/graph_visual/Base/hard/graph307.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 28 nodes numbered from 0 to 27:\nnode 0 should be visited before node10\... |
topology-hard-graph55 | data/topology/graph_visual/Base/hard/graph55.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 26 nodes numbered from 0 to 25:\nnode 0 should be visited before node6\n... |
topology-hard-graph560 | data/topology/graph_visual/Base/hard/graph560.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 30 nodes numbered from 0 to 29:\nnode 0 should be visited before node21\... |
topology-hard-graph732 | data/topology/graph_visual/Base/hard/graph732.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 32 nodes numbered from 0 to 31:\nnode 0 should be visited before node23\... |
topology-hard-graph1072 | data/topology/graph_visual/Base/hard/graph1072.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 34 nodes numbered from 0 to 33:\nnode 0 should be visited before node1\n... |
topology-hard-graph474 | data/topology/graph_visual/Base/hard/graph474.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 29 nodes numbered from 0 to 28:\nnode 0 should be visited before node26\... |
topology-hard-graph21 | data/topology/graph_visual/Base/hard/graph21.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 26 nodes numbered from 0 to 25:\nnode 0 should be visited before node8\n... |
topology-hard-graph1024 | data/topology/graph_visual/Base/hard/graph1024.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 34 nodes numbered from 0 to 33:\nnode 0 should be visited before node12\... |
topology-hard-graph838 | data/topology/graph_visual/Base/hard/graph838.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 32 nodes numbered from 0 to 31:\nnode 0 should be visited before node11\... |
topology-hard-graph1184 | data/topology/graph_visual/Base/hard/graph1184.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 35 nodes numbered from 0 to 34:\nnode 0 should be visited before node1\n... |
topology-hard-graph402 | data/topology/graph_visual/Base/hard/graph402.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 29 nodes numbered from 0 to 28:\nnode 0 should be visited before node9\n... |
topology-hard-graph636 | data/topology/graph_visual/Base/hard/graph636.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 31 nodes numbered from 0 to 30:\nnode 0 should be visited before node27\... |
topology-hard-graph948 | data/topology/graph_visual/Base/hard/graph948.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 33 nodes numbered from 0 to 32:\nnode 0 should be visited before node10\... |
topology-hard-graph799 | data/topology/graph_visual/Base/hard/graph799.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 32 nodes numbered from 0 to 31:\nnode 0 should be visited before node22\... |
topology-hard-graph835 | data/topology/graph_visual/Base/hard/graph835.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 32 nodes numbered from 0 to 31:\nnode 0 should be visited before node21\... |
topology-hard-graph673 | data/topology/graph_visual/Base/hard/graph673.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 31 nodes numbered from 0 to 30:\nnode 0 should be visited before node13\... |
topology-hard-graph485 | data/topology/graph_visual/Base/hard/graph485.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 30 nodes numbered from 0 to 29:\nnode 0 should be visited before node2\n... |
topology-hard-graph1008 | data/topology/graph_visual/Base/hard/graph1008.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 34 nodes numbered from 0 to 33:\nnode 0 should be visited before node8\n... |
topology-hard-graph445 | data/topology/graph_visual/Base/hard/graph445.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 29 nodes numbered from 0 to 28:\nnode 0 should be visited before node6\n... |
topology-hard-graph201 | data/topology/graph_visual/Base/hard/graph201.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 27 nodes numbered from 0 to 26:\nnode 0 should be visited before node19\... |
topology-hard-graph458 | data/topology/graph_visual/Base/hard/graph458.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 29 nodes numbered from 0 to 28:\nnode 0 should be visited before node7\n... |
topology-hard-graph1151 | data/topology/graph_visual/Base/hard/graph1151.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 35 nodes numbered from 0 to 34:\nnode 0 should be visited before node20\... |
topology-hard-graph802 | data/topology/graph_visual/Base/hard/graph802.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 32 nodes numbered from 0 to 31:\nnode 0 should be visited before node6\n... |
topology-hard-graph438 | data/topology/graph_visual/Base/hard/graph438.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 29 nodes numbered from 0 to 28:\nnode 0 should be visited before node2\n... |
topology-hard-graph947 | data/topology/graph_visual/Base/hard/graph947.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 33 nodes numbered from 0 to 32:\nnode 0 should be visited before node21\... |
topology-hard-graph1073 | data/topology/graph_visual/Base/hard/graph1073.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 34 nodes numbered from 0 to 33:\nnode 0 should be visited before node2\n... |
topology-hard-graph1015 | data/topology/graph_visual/Base/hard/graph1015.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 34 nodes numbered from 0 to 33:\nnode 0 should be visited before node23\... |
topology-hard-graph1190 | data/topology/graph_visual/Base/hard/graph1190.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 35 nodes numbered from 0 to 34:\nnode 0 should be visited before node21\... |
topology-hard-graph56 | data/topology/graph_visual/Base/hard/graph56.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 26 nodes numbered from 0 to 25:\nnode 0 should be visited before node9\n... |
topology-hard-graph861 | data/topology/graph_visual/Base/hard/graph861.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 33 nodes numbered from 0 to 32:\nnode 0 should be visited before node11\... |
topology-hard-graph628 | data/topology/graph_visual/Base/hard/graph628.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 31 nodes numbered from 0 to 30:\nnode 0 should be visited before node18\... |
topology-hard-graph1128 | data/topology/graph_visual/Base/hard/graph1128.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 35 nodes numbered from 0 to 34:\nnode 0 should be visited before node19\... |
topology-hard-graph350 | data/topology/graph_visual/Base/hard/graph350.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 28 nodes numbered from 0 to 27:\nnode 0 should be visited before node20\... |
topology-hard-graph833 | data/topology/graph_visual/Base/hard/graph833.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 32 nodes numbered from 0 to 31:\nnode 0 should be visited before node27\... |
topology-hard-graph859 | data/topology/graph_visual/Base/hard/graph859.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 33 nodes numbered from 0 to 32:\nnode 0 should be visited before node5\n... |
topology-hard-graph1054 | data/topology/graph_visual/Base/hard/graph1054.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 34 nodes numbered from 0 to 33:\nnode 0 should be visited before node8\n... |
topology-hard-graph664 | data/topology/graph_visual/Base/hard/graph664.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 31 nodes numbered from 0 to 30:\nnode 0 should be visited before node6\n... |
topology-hard-graph513 | data/topology/graph_visual/Base/hard/graph513.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 30 nodes numbered from 0 to 29:\nnode 0 should be visited before node21\... |
topology-hard-graph156 | data/topology/graph_visual/Base/hard/graph156.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 27 nodes numbered from 0 to 26:\nnode 0 should be visited before node21\... |
topology-hard-graph1084 | data/topology/graph_visual/Base/hard/graph1084.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 35 nodes numbered from 0 to 34:\nnode 0 should be visited before node30\... |
topology-hard-graph738 | data/topology/graph_visual/Base/hard/graph738.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 32 nodes numbered from 0 to 31:\nnode 0 should be visited before node25\... |
topology-hard-graph129 | data/topology/graph_visual/Base/hard/graph129.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 27 nodes numbered from 0 to 26:\nnode 0 should be visited before node20\... |
topology-hard-graph408 | data/topology/graph_visual/Base/hard/graph408.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 29 nodes numbered from 0 to 28:\nnode 0 should be visited before node16\... |
topology-hard-graph23 | data/topology/graph_visual/Base/hard/graph23.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 26 nodes numbered from 0 to 25:\nnode 0 should be visited before node4\n... |
topology-hard-graph728 | data/topology/graph_visual/Base/hard/graph728.png | [
{
"from": "human",
"value": "<image>\nThis diagram depicts a directed graph, in which each directed edge from node A to node B signifies that, according to the topological order, node A must precede node B.\nIn this directed graph with 32 nodes numbered from 0 to 31:\nnode 0 should be visited before node8\n... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.