id stringlengths 15 65 | image stringlengths 42 73 ⌀ | conversations listlengths 2 2 |
|---|---|---|
topology-hard-graph326 | data/topology/graph_visual/Base/hard/graph326.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 node6\n... |
topology-hard-graph258 | data/topology/graph_visual/Base/hard/graph258.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-graph826 | data/topology/graph_visual/Base/hard/graph826.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 node18\... |
topology-hard-graph41 | data/topology/graph_visual/Base/hard/graph41.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-graph367 | data/topology/graph_visual/Base/hard/graph367.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-graph902 | data/topology/graph_visual/Base/hard/graph902.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 node19\... |
topology-hard-graph1129 | data/topology/graph_visual/Base/hard/graph1129.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-graph306 | data/topology/graph_visual/Base/hard/graph306.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 node26\... |
topology-hard-graph876 | data/topology/graph_visual/Base/hard/graph876.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-graph178 | data/topology/graph_visual/Base/hard/graph178.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 node6\n... |
topology-hard-graph80 | data/topology/graph_visual/Base/hard/graph80.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-graph874 | data/topology/graph_visual/Base/hard/graph874.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 node14\... |
topology-hard-graph562 | data/topology/graph_visual/Base/hard/graph562.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 node4\n... |
topology-hard-graph932 | data/topology/graph_visual/Base/hard/graph932.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-graph330 | data/topology/graph_visual/Base/hard/graph330.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 node13\... |
topology-hard-graph551 | data/topology/graph_visual/Base/hard/graph551.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-graph558 | data/topology/graph_visual/Base/hard/graph558.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-graph801 | data/topology/graph_visual/Base/hard/graph801.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 node15\... |
topology-hard-graph420 | data/topology/graph_visual/Base/hard/graph420.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-graph348 | data/topology/graph_visual/Base/hard/graph348.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-graph800 | data/topology/graph_visual/Base/hard/graph800.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 node19\... |
topology-hard-graph484 | data/topology/graph_visual/Base/hard/graph484.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 node6\n... |
topology-hard-graph804 | data/topology/graph_visual/Base/hard/graph804.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-graph1137 | data/topology/graph_visual/Base/hard/graph1137.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-graph522 | data/topology/graph_visual/Base/hard/graph522.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 node7\n... |
topology-hard-graph1124 | data/topology/graph_visual/Base/hard/graph1124.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-graph837 | data/topology/graph_visual/Base/hard/graph837.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... |
topology-hard-graph760 | data/topology/graph_visual/Base/hard/graph760.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-graph754 | data/topology/graph_visual/Base/hard/graph754.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 1 should be visited before node29\... |
topology-hard-graph246 | data/topology/graph_visual/Base/hard/graph246.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-graph409 | data/topology/graph_visual/Base/hard/graph409.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 node5\n... |
topology-hard-graph520 | data/topology/graph_visual/Base/hard/graph520.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-graph767 | data/topology/graph_visual/Base/hard/graph767.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-graph772 | data/topology/graph_visual/Base/hard/graph772.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-graph622 | data/topology/graph_visual/Base/hard/graph622.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-graph1068 | data/topology/graph_visual/Base/hard/graph1068.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 node33\... |
topology-hard-graph1192 | data/topology/graph_visual/Base/hard/graph1192.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 node9\n... |
topology-hard-graph920 | data/topology/graph_visual/Base/hard/graph920.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 node20\... |
topology-hard-graph945 | data/topology/graph_visual/Base/hard/graph945.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 node14\... |
topology-hard-graph625 | data/topology/graph_visual/Base/hard/graph625.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 node20\... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.