id stringlengths 15 65 | image stringlengths 42 73 ⌀ | conversations listlengths 2 2 |
|---|---|---|
topology-hard-graph600 | data/topology/graph_visual/Base/hard/graph600.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 node29\... |
topology-hard-graph369 | data/topology/graph_visual/Base/hard/graph369.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 node28\... |
topology-hard-graph951 | data/topology/graph_visual/Base/hard/graph951.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 node2\n... |
topology-hard-graph670 | data/topology/graph_visual/Base/hard/graph670.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 node8\n... |
topology-hard-graph1143 | data/topology/graph_visual/Base/hard/graph1143.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 node7\n... |
topology-hard-graph35 | data/topology/graph_visual/Base/hard/graph35.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-graph1167 | data/topology/graph_visual/Base/hard/graph1167.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 node22\... |
topology-hard-graph425 | data/topology/graph_visual/Base/hard/graph425.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 node22\... |
topology-hard-graph793 | data/topology/graph_visual/Base/hard/graph793.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 node20\... |
topology-hard-graph950 | data/topology/graph_visual/Base/hard/graph950.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 node23\... |
topology-hard-graph540 | data/topology/graph_visual/Base/hard/graph540.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 node1\n... |
topology-hard-graph965 | data/topology/graph_visual/Base/hard/graph965.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-graph1149 | data/topology/graph_visual/Base/hard/graph1149.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 node32\... |
topology-hard-graph713 | data/topology/graph_visual/Base/hard/graph713.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 node14\... |
topology-hard-graph1041 | data/topology/graph_visual/Base/hard/graph1041.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 node29\... |
topology-hard-graph509 | data/topology/graph_visual/Base/hard/graph509.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 node26\... |
topology-hard-graph676 | data/topology/graph_visual/Base/hard/graph676.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 node29\... |
topology-hard-graph60 | data/topology/graph_visual/Base/hard/graph60.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 node21\... |
topology-hard-graph730 | data/topology/graph_visual/Base/hard/graph730.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 node7\n... |
topology-hard-graph534 | data/topology/graph_visual/Base/hard/graph534.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 node1\n... |
topology-hard-graph918 | data/topology/graph_visual/Base/hard/graph918.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 node15\... |
topology-hard-graph473 | data/topology/graph_visual/Base/hard/graph473.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 node27\... |
topology-hard-graph1090 | data/topology/graph_visual/Base/hard/graph1090.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 node12\... |
topology-hard-graph281 | data/topology/graph_visual/Base/hard/graph281.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 node1\n... |
topology-hard-graph742 | data/topology/graph_visual/Base/hard/graph742.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 node20\... |
topology-hard-graph47 | data/topology/graph_visual/Base/hard/graph47.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-graph1088 | data/topology/graph_visual/Base/hard/graph1088.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 node3\n... |
topology-hard-graph1074 | data/topology/graph_visual/Base/hard/graph1074.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-graph136 | data/topology/graph_visual/Base/hard/graph136.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 node23\... |
topology-hard-graph160 | data/topology/graph_visual/Base/hard/graph160.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-graph8 | data/topology/graph_visual/Base/hard/graph8.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 node23\... |
topology-hard-graph645 | data/topology/graph_visual/Base/hard/graph645.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 node29\... |
topology-hard-graph936 | data/topology/graph_visual/Base/hard/graph936.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 node3\n... |
topology-hard-graph830 | data/topology/graph_visual/Base/hard/graph830.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 node1\n... |
topology-hard-graph121 | data/topology/graph_visual/Base/hard/graph121.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 node13\... |
topology-hard-graph395 | data/topology/graph_visual/Base/hard/graph395.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 node22\... |
topology-hard-graph911 | data/topology/graph_visual/Base/hard/graph911.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 node13\... |
topology-hard-graph652 | data/topology/graph_visual/Base/hard/graph652.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 node24\... |
topology-hard-graph731 | data/topology/graph_visual/Base/hard/graph731.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-graph797 | data/topology/graph_visual/Base/hard/graph797.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-graph1126 | data/topology/graph_visual/Base/hard/graph1126.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 node14\... |
topology-hard-graph481 | data/topology/graph_visual/Base/hard/graph481.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-graph630 | data/topology/graph_visual/Base/hard/graph630.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 node25\... |
topology-hard-graph1156 | data/topology/graph_visual/Base/hard/graph1156.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-graph495 | data/topology/graph_visual/Base/hard/graph495.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 node10\... |
topology-hard-graph1001 | data/topology/graph_visual/Base/hard/graph1001.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 node19\... |
topology-hard-graph877 | data/topology/graph_visual/Base/hard/graph877.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-graph914 | data/topology/graph_visual/Base/hard/graph914.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 node4\n... |
topology-hard-graph411 | data/topology/graph_visual/Base/hard/graph411.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-graph360 | data/topology/graph_visual/Base/hard/graph360.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 node16\... |
topology-hard-graph394 | data/topology/graph_visual/Base/hard/graph394.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-graph372 | data/topology/graph_visual/Base/hard/graph372.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 node17\... |
topology-hard-graph1160 | data/topology/graph_visual/Base/hard/graph1160.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-graph1191 | data/topology/graph_visual/Base/hard/graph1191.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-graph238 | data/topology/graph_visual/Base/hard/graph238.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 node22\... |
topology-hard-graph1083 | data/topology/graph_visual/Base/hard/graph1083.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 node10\... |
topology-hard-graph688 | data/topology/graph_visual/Base/hard/graph688.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 node21\... |
topology-hard-graph325 | data/topology/graph_visual/Base/hard/graph325.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 1 should be visited before node7\n... |
topology-hard-graph144 | data/topology/graph_visual/Base/hard/graph144.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 node2\n... |
topology-hard-graph202 | data/topology/graph_visual/Base/hard/graph202.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-graph909 | data/topology/graph_visual/Base/hard/graph909.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 node22\... |
topology-hard-graph967 | data/topology/graph_visual/Base/hard/graph967.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-graph836 | data/topology/graph_visual/Base/hard/graph836.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 node12\... |
topology-hard-graph856 | data/topology/graph_visual/Base/hard/graph856.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-graph309 | data/topology/graph_visual/Base/hard/graph309.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 node21\... |
topology-hard-graph928 | data/topology/graph_visual/Base/hard/graph928.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 node31\... |
topology-hard-graph1056 | data/topology/graph_visual/Base/hard/graph1056.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-graph542 | data/topology/graph_visual/Base/hard/graph542.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 node14\... |
topology-hard-graph338 | data/topology/graph_visual/Base/hard/graph338.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-graph393 | data/topology/graph_visual/Base/hard/graph393.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-graph842 | data/topology/graph_visual/Base/hard/graph842.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 node23\... |
topology-hard-graph1031 | data/topology/graph_visual/Base/hard/graph1031.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 node28\... |
topology-hard-graph96 | data/topology/graph_visual/Base/hard/graph96.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-graph233 | data/topology/graph_visual/Base/hard/graph233.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 node11\... |
topology-hard-graph677 | data/topology/graph_visual/Base/hard/graph677.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 node4\n... |
topology-hard-graph906 | data/topology/graph_visual/Base/hard/graph906.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-graph10 | data/topology/graph_visual/Base/hard/graph10.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-graph668 | data/topology/graph_visual/Base/hard/graph668.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 node24\... |
topology-hard-graph533 | data/topology/graph_visual/Base/hard/graph533.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 node3\n... |
topology-hard-graph721 | data/topology/graph_visual/Base/hard/graph721.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 node31\... |
topology-hard-graph370 | data/topology/graph_visual/Base/hard/graph370.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 node3\n... |
topology-hard-graph541 | data/topology/graph_visual/Base/hard/graph541.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 node17\... |
topology-hard-graph1107 | data/topology/graph_visual/Base/hard/graph1107.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-graph1081 | data/topology/graph_visual/Base/hard/graph1081.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-graph680 | data/topology/graph_visual/Base/hard/graph680.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 node15\... |
topology-hard-graph982 | data/topology/graph_visual/Base/hard/graph982.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 node20\... |
topology-hard-graph73 | data/topology/graph_visual/Base/hard/graph73.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 node23\... |
topology-hard-graph84 | data/topology/graph_visual/Base/hard/graph84.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-graph884 | data/topology/graph_visual/Base/hard/graph884.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 node8\n... |
topology-hard-graph451 | data/topology/graph_visual/Base/hard/graph451.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 node28\... |
topology-hard-graph1021 | data/topology/graph_visual/Base/hard/graph1021.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 node11\... |
topology-hard-graph794 | data/topology/graph_visual/Base/hard/graph794.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-graph349 | data/topology/graph_visual/Base/hard/graph349.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 node9\n... |
topology-hard-graph892 | data/topology/graph_visual/Base/hard/graph892.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 node9\n... |
topology-hard-graph571 | data/topology/graph_visual/Base/hard/graph571.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-graph552 | data/topology/graph_visual/Base/hard/graph552.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 node25\... |
topology-hard-graph143 | data/topology/graph_visual/Base/hard/graph143.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 node10\... |
topology-hard-graph954 | data/topology/graph_visual/Base/hard/graph954.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 node12\... |
topology-hard-graph396 | data/topology/graph_visual/Base/hard/graph396.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 node10\... |
topology-hard-graph610 | data/topology/graph_visual/Base/hard/graph610.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 node20\... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.