id
stringlengths
23
26
task
stringclasses
6 values
prompt
stringlengths
8.51k
88.4k
answer
stringlengths
105
110k
grbench_main_art_000000
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["112bf6101a","1202e5f72f","1969bf5160","36074aa5f7","3a21694a5f","40acb62d7c","4458b58214","493fbd7dda","520cda179f","5ddc633f5a","5ec69f91be","6b90b371d9","6fe6aebf3f","70773198da","80358f256f","80d9423c7a","89fa0557f9","ae49d1c0e2","c103982a83","c2307b7aa9","cc7e93cf42","d258fcab9b","d9ce96ac9d","dd62ff5294","e3db24...
grbench_main_art_000001
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["07ef40418c","0c009307e5","112b1debe4","2347acc2d2","2a4980a468","4e59ec5630","5949e4d819","5ad719d0b9","5bb27e4710","697586380f","84553c2960","8670e0ccc3","88b92d6800","9b4ef9f9c1","aa59098e87","b007c99bef","b91c34c096","cf94109287","d3353aa8f7","ebe3b6e516","f7563e9b74"]
grbench_main_art_000002
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["005dd1cf96","090e4b287f","0aa463c3b5","14ab17387f","17bdde0803","213c70e840","252615c73d","2ec3752380","3a16f2b3e7","43273f0a45","4a8cfdf4fa","571acb2982","617f2cf934","8135b7642b","863d007a71","943080d02c","a2a05d8cb7","b29f79e6f2","bc0e04ef7a","bf50020021","c7d059baf8","d0c35586a3"]
grbench_main_art_000003
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["27d3b43871","300deb0147","35423c44a9","3bd886345d","5ed700502b","652beaf062","6735d8d416","6c9a8f35ec","6f93bdebe4","744bf36f1c","7fd40e03f0","88b8a9b549","a0c8a47f9d","abad0e4c2c","ae4649e2c9","b166da2508","cab1b3a3e7","ece0503343","ed4d2f3051","ef9077a4cb"]
grbench_main_art_000004
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0d3a921dc5","0f38b30fdf","1f650c1544","37a74e780d","37c29a7ac7","3ace20e7a4","4c87c77079","576dc85133","5c5c74a578","69af223e74","937d3813aa","9436d015f5","9a118ac4a9","9cd82978e4","a4de6d0eb3","a5c587c497","c815121141","dce510e856","e6829ead75","e7f387f09b","f552b0c5d3","f6d54320d8"]
grbench_main_art_000005
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["16c86d2c7e","2afa1901b7","3670f4c099","3cb4373a37","40aedfb918","4e644f42c0","54970b5a5a","552752348e","5647c9498e","5cebcaaa34","76c206aa61","7996edcc94","7a80d0a359","82064582ca","9085413aa4","96547d1301","9bf7436df6","b2c65daf64","bac7eb1593","d12b27f5db","e549e7e16d","f921739e1b","fd37a94e35"]
grbench_main_art_000006
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["01a7c548a9","06802431c6","4c74c4c014","582fc95f8a","7066e82bb2","8f0678cf5f","9b9b24c44f","9bbd0ec8cf","9cc0b486a5","bb456151d6","c286e7fd18","ca70f2cbef","dba47fdcb8","e382d37d46","e94359610a","eef051bf6a","f56b27024e","fcb7472c18","fd67cdb679"]
grbench_main_art_000007
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["042ac0936e","0e38fb62e7","128e2a2766","1a23e67d73","1ac8d67d3b","1e94065a5c","3587cbe150","54b9ce8552","604b15de64","64271be9db","6f980f60ce","7f9ff61c72","84b3b0c357","8bcd135969","8eab373c18","9335e14713","a32516e5ba","a8da4687f2","ad25a34ce2","ca585f3213","e78a4ce00d","ed96b03f2a"]
grbench_main_art_000008
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["11e0784447","14632ebf5e","1c854f48ed","3ddd46cca7","4f3f6b134e","54dbc9f21f","59380efc4d","5c23941f39","60eaac46dc","82078be58e","8ed2903e0b","92134d086f","9428acdcba","a2df9f3864","ab4339560a","ae6ee2e765","b4d600d22a","b9cc2d9f7c","c437386a66","c6374b4566","cb3a58cf0a","d8c13e7bbb","e611ee60c9","eb3827b8bd"]
grbench_main_art_000009
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0d6254141b","0f320f8dfa","23425eff81","2bb566e366","2c981acc67","3633c37d97","4749c818fd","619e38fdb5","6fdb24d117","7155c3061f","7715148a1b","79ccb1035b","80a72154ac","812e56e645","9619ece805","9b7e6a375c","a86e7c2205","b4cfaa1114","b6569f9d7b","bc4864fa98","d67457591d","f5f18d961c","f9b468612a","fae6249b1c"]
grbench_main_art_000010
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["01382a4770","0361adf3b7","21ca8ffa70","26011eb18a","348ae1335c","39191923b5","3940c99406","3e56758e47","3fb7927909","4871a6ed41","554e96db76","6c911b2f41","739cd96d12","79e3efb4d6","86fd6132ac","937f893c69","a266a69fac","a90d63883f","b375bcbb4f","b9132474c1","c1bfd2fd93","cba71112f8","ccf0924db2","d34cc54143","e4d3fe...
grbench_main_art_000011
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0d128fd9ac","14736084dd","1f34118128","26855424c9","3f0b58d02b","4013d175c4","5a52d830bc","6d74e8bcfe","784aeb2fc2","7fc819ecef","8751db1dbc","aacdac8239","ab0117bc1d","acb39f6164","d8195dfeb4","dfb84d54ef","e70d102f6f","ed93c07620","f53ce24482","f5ff15a755"]
grbench_main_art_000012
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["11809ee0ed","11dbf55a5f","138949cc39","3aeb568d87","5293fdf969","541e6ebb7d","5467a5172b","67fcfc9da0","6e137b0a92","7230ad8aaa","783375b2f8","7cbd05a5b4","a4affc93a2","a76a2cd5c0","abbb072cb9","b7e569d476","c0d44ebb6e","cd44a622c8","e1140ce18a","e124098daf"]
grbench_main_art_000013
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0c35684d9f","1487a052ea","16f532e86f","1c9aee6f41","2bfcac3ab4","2fecef29c3","34679754f5","37c90c221c","67293b2a3f","7893efe3a7","7be187a3c7","914fde90c9","9263f59b6e","9c71fd9929","a2ad15595a","b45cbe90fd","b68ffb892f","c1514873c0","da6a9e74a7","e1b566a430","ea656ab069","ec6f1b83e4","eefb1e438c","f653e40c7a","fa142a...
grbench_main_art_000014
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0d6738684b","2ea3222311","39daf6a1bd","415c120c6e","54a75a0fa3","6039b28849","6a06be9865","6b35cdb369","7b9646431e","84ad9800fc","96876fff89","9cb96ec09f","adc5d66785","adebbdeecc","ae990c061d","b934b83d94","cbc592edcf","dc0002eb8e","ee54133b7b","ef795501c2"]
grbench_main_art_000015
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0da7db80eb","1f90c96610","2ef4837a05","35d463df3f","4e6f7f87a7","53151c39cc","5f94e77945","6c52801e21","77b64f65a4","7a682941cc","7e1e6ce91e","868b4878bb","b5764cb97b","c43cafacaf","c66f3c70d3","d51e7f5824","e72df08454","e835a04fd3","eff6c55a88","f070a37781","fa75b3631b"]
grbench_main_art_000016
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["11bbf42dd2","26d33408a3","30a19f5afb","4da05fe9f8","558b0317eb","5df304bc28","6197326b3d","77e5ac8385","875481f97f","8a879e3351","8ba5dc1837","90c86d317b","b5256a9f0a","b92d098126","c359f3bc31","c9d4bc62de","ca58a3385a","d17537f940","d34bbd8cb9","d590e2d6f0"]
grbench_main_art_000017
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["04a215e4f7","09bbf81b3d","0b0fd95c69","3397badc5e","35f8ad886c","3921f129e2","3c89dc43ee","4caf65c69d","5590bce2f2","5be69b5c55","7735be1b09","956850ec27","aacc3522e7","ae7dd11c74","ba471b5b5c","baa549bb37","cabf579dd2","cec03f6f69","e03e3a68d7","fca5df9d8e"]
grbench_main_art_000018
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["06c10a7ff7","1802e6b106","18e6d1894c","209b3eb0fa","23aaf4a40e","380cef8c48","4f599ede6c","58ea84412e","6eaf25a308","89fbd5fb3e","8a7e12fc81","8b33862d6a","8b83d5d2c5","9ec52b575a","b8c4b79a25","dcbab9fd34","f47aeb2e84","ff2d8815cd"]
grbench_main_art_000019
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["064d01a686","0df9e2a189","108e48d27e","1ac211734f","1e6f58d7a0","2a375f0d6f","343084cd05","40c6e3ca45","441d60736b","4a04dbc9fa","4d35c8704f","5044db58e1","5e1cab9ecd","6f15ca99a0","76dedb8956","9dd57ae4e9","ab9188af09","b5098f372a","b742d07a51","d777fd3f6c","df98ac0e9a","e7988e1e98","f890f08220"]
grbench_main_art_000020
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["05875370a0","0a58671e73","1cee87a87e","2475cda7cc","39b9055b9d","3bbe35047a","46d781acb8","5f02d5280c","63851caa6a","643a823cde","744d11755c","76ffe1451f","8196a2a7e0","b7d0da2164","c467a07882","c8c5f30167","d0b885b798","d52df143a7","e3fe53760f","fa70374c38"]
grbench_main_art_000021
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["06a333900e","0b88a109dc","0c06b8e25d","238fb8cf73","2b52a688e7","3a8203a763","4447a9dbda","51705fcd55","5a6fad8246","71c30fa6ca","8614fc1cae","8e652a56a1","8ee0a541b8","9150b92e61","9c74e2340e","9f666f1a15","ba6b7ff6e7","ca0d6ec045","cc6d45930b","d036546a86","f801311d2f"]
grbench_main_art_000022
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["017ed87167","061f941420","0c72b75cbb","13dc593559","1657537c4c","32bedb47a6","3a329098f4","44c154b24b","4ed0174dd8","53eee85873","5ae8f4972c","6fff0ee4fc","81a64a092d","893276d6ae","8dfc0c72fb","91b8472d2b","99e6b3fdd2","9b25358059","a1cbc85d34","b7e7766f20","b9b2d7530a","c05e3cd189","ccf5234702","cf50aab43c","d54060...
grbench_main_art_000023
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["051169e4e9","0783f6dbb5","0ee447746b","12dc85d423","19538efc55","2d1926109e","43bdc64b63","4994f7ea8f","598d260d74","69518d9eac","6eaa28e076","782f1f32aa","856fb9a255","92e6cfe60e","964ee1e92d","97b79e5300","9b321f1117","a2c16ac081","ab31d05a27","bb427094fd","bda02f1179","be087e50d3","dbda52904b","dbe63af065","e4a633...
grbench_main_art_000024
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0de99ea47e","1179acd6cc","1490ee80a6","14f6cba883","2251cd5126","279fd81b5e","30834c21ea","315a127d61","3d3f49d25f","696a1075bc","6b52e3c52a","72c6800193","9b79b90db7","a4a04509e7","b629167252","b8e8316a2f","d131aad3fe","d4e259724d","d6c1a4b89f","eb22042aa9","f77470b4cb","feee8b13d3"]
grbench_main_art_000025
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0799ce255a","172035fbd6","17daba997a","1d12085442","2358ebf0cb","247c976e9a","276a4478c8","3fff2fa219","5090561eb3","5b9c883106","75f668af1b","7b0215a8c0","7c056c1437","7c9344c901","81b6a563e0","8c5e62f678","92d0dcbe9c","abb067ac11","ad536dcda2","bb036d3d7d","cdd50fde10","d874f496ec","ec860da633","ee852ef014","ef0e38...
grbench_main_art_000026
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["093ccf5c56","0abeffb481","0bf14d3749","1bc31bcc2d","1d7436bfe1","23831af355","2cb2222fb4","362f64959d","3ae005df2e","53e9b39d58","640d644d9b","65fd9e544f","70030ece64","821e894a2a","8437830d6c","86a2cedc0b","9527f19666","9b3447a64b","b5b8160d14","b96c4fb44e","bac6bac3c5","c60d5fbd1b","cf57d2d36b","da8879d26c","e12605...
grbench_main_art_000027
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0b8c8aada5","0d7faf4a63","10e104de73","178de37780","17a2b8c209","281777da9c","31496039ca","5eafd7c897","611abd262a","68abfc67aa","7c7faa71c4","7f71e45040","9d0247cd44","9eb98950e6","c0cce389d1","cb2b92e469","cc91057b5d","d451c64809","de1f8df1e1","e0adffb761","e18c5fe9c8","e3a42b496e","e7d706a8ed","eba5fe18e0","f01764...
grbench_main_art_000028
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["080f5c5046","1762fb7c66","1e2530dcde","25e2a8ac45","31eb107ab2","3b27407a63","40fc4b8fcb","45ae1302e5","4ce38df861","53d6cdb7b5","58e3d2304d","6c0992ee78","760acbe902","7e7369e8a2","7f2eddf1bd","823eae50bd","824a8d68ef","85702e6f57","93b343fdb5","9938691bf2","995bc0de99","a0b49376ae","b0a03907e1","bb7e25cf98","be2edb...
grbench_main_art_000029
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0437f956d5","0ba21d22a5","15119cc9d9","151e0fdae4","156292ce30","15e3a7c63a","1c0e5161d7","2609edd0a9","27b508cf1d","4cf481476d","4e304d437a","52ca021b85","572183ded5","5b455aa259","6af3add366","6b78622926","7394174ac4","77f6908a46","7b2f92efc2","8214b8aeed","84641f3d4d","85ca68d140","860f67bb82","b5d25134cf","bec84a...
grbench_main_art_000030
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0aab152061","0b1c31d9ac","139e1ef8fd","2694ba0113","47eeb0d710","56eac11e04","62fa17cffb","6919705924","8746ef245f","8a3582af52","90d02a83a6","9f88f1000a","a8e676ddb4","ac4f1d3d81","d4bc1fc010","dbed9b0c9e","e22fc37e4a","ea8c452ea0","f908fcde2d","fa8dc0aea2"]
grbench_main_art_000031
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["060a75c6d4","0b7844f904","1622e4ae31","18edb0d0a5","1a47810cbf","2ce85a695a","36b550e0a7","47f5e03728","4f50a2a675","5da5643672","62d18b9ed7","6927a65d6d","6d1e7ca4b3","7f4929be5b","7f9a694d0f","822be56d60","875ddb2cca","90f66bc618","d10d857789","d55e0ac66b","e1497a7ab6","e75eba84bf","ed84ff9485","f3a51ae398"]
grbench_main_art_000032
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["06e73903b9","19747139c5","1b5223f435","1ee75746f4","25ec4f62e0","41f50e3230","46c6162c7b","5319b3027a","69952f0061","74b9bc552e","8bd17f3eb7","98154c0f4b","9c05828e48","b2b3dada27","b9acc17099","c2dda1762e","d1f80cad68","dfab2879c6","fbf351e3ef"]
grbench_main_art_000033
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0768a43ed6","0f6c7aeb0e","149aa497a7","1e898a19dc","27d39cc487","28902909a5","2a42cc4169","36d62d9cce","3aac436fdf","45222757d3","4a3f9557a1","4f4ae5df82","6ed9d50050","7f1c9ca517","8464fb961a","94b06861b8","b5297ae3ba","d06a5bfbe6","d5c6e836e1","d78cd3a9d0","e5547c26dc","f7dcf0a990","fea34447ca"]
grbench_main_art_000034
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["02214fddd0","065c7c0442","0a925964ed","11dca4ce2c","14aee1f38f","1712617368","21d175c932","2522f9c61c","2f9446673f","49e276ecfc","60af1a4e71","76fe7df4c6","7ca074c823","8b238078e6","8cd8393a80","8cec0b817c","98ef68b49b","b1d836c351","cad96ee89e","d2de7ba993","debaa805d0","f11e28c3f8","f4bd661a57"]
grbench_main_art_000035
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["015704dbf3","0928e21e25","14a9873f2e","20bebd4d35","34f8be8975","393c237e88","43bb0d243b","48afefd8a2","6901069d56","6f60ee3e61","98d1d75a2c","a1419be8be","bab46eeae4","bdc2823a2f","c185f0da6c","c3f22d7403","cd635d6e3d","f11dc5c2b0"]
grbench_main_art_000036
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["03f5bd6ba6","17afe38c5b","1adc2e2f46","1b4ec08f3c","1d81dd46d2","1ee082b396","31b4c55161","4b0b952581","599e188f69","61b7eb608a","6fb36e5aff","71f297f765","8d75cc1956","945f4d605e","ae167d839b","b9f5568e43","e59d8f4798","f62caae290"]
grbench_main_art_000037
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["062ed17685","182b09cc0c","1a415742c7","1ccf53593e","23f58befba","294cdf750e","397323d6e5","39dfc64298","3f31550f20","4097c1c689","4884b26587","5d1a82a9b3","60253bcee2","66c0b11448","6c9dc17086","7d3883b7c4","8279c38eae","8df7b77228","adbf8f34e2","b7ed43a3aa","c16331ebea","c466d70360","cd33188aee","d6a02c74ec","d9ce91...
grbench_main_art_000038
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["01ed59a825","0827c62c66","10692d299a","12314123df","2c59221262","2f37966224","35d7e619a9","372a2bd634","62e1c553a2","632728863c","64b92c99b0","827315fa91","867e69f94f","8b49fe2d34","927050cabf","a318bc110f","a95dd1a263","accaec2115","cd94123d1d","e0aff2af6a","e1c4c53dea","e7ae1eec13","ee8d9dab05","ef8c8ad9c3","fe4a4d...
grbench_main_art_000039
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["03b52e5830","058d97be40","092949a5e4","20dc487d2e","520795c677","547ed5b598","55458383b2","5e3de87529","6fbba79f32","92345931ee","95eb13c60e","a32a56c56f","b5bec79630","b9a75ed503","beab7c8645","c3ab977c49","c71f7c2619","c9049a54a5","cc2fae1a56","f8473a2c85"]
grbench_main_art_000040
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["01e1ac6316","143bb7e4da","1ee7f0c033","316c2177c9","321661fe03","397e869010","4710ed29d8","57d7b520d8","697d444953","73245b14ea","874c1ea076","8fcae3af4f","b6dfcfbef2","c33a22265d","d740203574","e9a159b1cd","f1d249337c","f420f76663","f44b2390f3","f5047fab00","f8dc3e6caf"]
grbench_main_art_000041
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0b78069fb5","373074d292","393f4def6c","44fecf122a","5a4d8424cb","5da7a07960","5e5e1a6602","6034b25c13","72da37756b","7885136d7e","7a1bef2685","7a42ceee1b","7aafd3ed29","7c47560bf8","7ff63cd583","93c7fb3d1f","b7df0fd854","ba93b4d51e","d50f62575c","d8686dab01","df77033652","eec127cd4a","f59da09ebc"]
grbench_main_art_000042
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["05c0f40a67","0ee453ffc5","0ef9b13fa7","1e9108a7be","38d3c1103b","481b3552ec","4c91b7748e","5c42ef259d","6cf80fe2f1","7088d9f4ea","76ce1a07dc","936f6f41a3","a32d395f2f","b42d32fef1","b7c42454b9","c156421bf6","c7fe092d8a","c8c65bdf47","e5ca13e61d"]
grbench_main_art_000043
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["166f2c025d","2560f74f56","3448828d73","4076f793a9","49d0c356b6","552df100f0","7248f70024","7ffd1335ca","84119a1fbe","847a042f80","87effcea81","8b005a23a6","8c1a91e4f6","9e5627c9bf","bf02735eeb","cd425402c7"]
grbench_main_art_000044
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["12aa782d33","2bbe1b1738","3f9ca1c724","411eea31f0","616334287d","664440f4ea","6a4da5f16d","7962b637d5","8ad3b57b52","8d2c778162","9171ee4703","bef1be5989","c15879783e","c15d59901e","d87b02f2b0","dce62c0ae4","fec156b9aa"]
grbench_main_art_000045
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["14250cc4d6","16044a17d5","1c8900a4c7","3149101e6e","31ee25c84e","4b856d3924","51862cd690","6a5d51849e","7549ad3cf0","780ec2a214","7857feb12b","835cdad5dd","850e6586c4","91587a45b4","b1916d8a02","bb31bce574","cda6c1a1d5","e0bc605aa6","e2a5f04694","e6edee1557","ed457edb66","fd05acd133"]
grbench_main_art_000046
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0e27cbd223","10d9b80398","1c00794012","415de68c53","5e23d7bdcd","6315660384","6bf4122f6d","715477817b","7de3565148","88fd5c7849","920fe49c6a","99361d35ac","b253f40928","b2cf9af9a6","c233248b76","e5f3921234","f494547bda","f5fcc079db","fa705dba0b"]
grbench_main_art_000047
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["1222150aa2","17054faab0","2c2f53f2b7","384c0b7b95","3af8f84595","494e65d502","4a0b26b3f3","58c0ae2c32","7840ba962c","7d4cca4ef6","804a277d55","88b44b1a26","91165b75c5","99cc79217a","a22993838d","cd042561d9","cde2e78cd4","d02be57351","d2ea0cbd9a","e0c1fb3fc1","eda90ebc5f","edd644dd10","ee22e2fe2b","f652138cb2","f7e788...
grbench_main_art_000048
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["11e7810f6b","1530210015","196effad05","1e924b1b03","1ef20633a2","33748f0db9","3ee727c6a1","41d0c19d0d","4b6133b850","52359b4dca","62b5e79646","6fd6d916d4","71d789859b","7579106000","9a6864fb00","9cd3f63543","aecec75068","bd950a81be","cc864c82c3","d3e5595213","e0ec626a06","e85e1512f4","e8e79fb2ae","f3daca1840","f4f822...
grbench_main_art_000049
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0fd866474f","1175cf561e","1e2f1e8aba","26178f4c45","28f66109fd","3eee70d3ec","40dd53725f","4c43b01343","5591a58b7c","5992ceaacc","64623e867e","7c755278f9","826ccf6282","8a972f5bfb","8f6b26507e","8feff35ebe","943f85519f","9a81130a98","a585a54c40","a85489c71c","a88ebd5f8a","ba5f8491c4","de2fdf21f9","df1c034718","fb9bf0...
grbench_main_art_000050
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["01ba4384ab","0c243d8db8","188f457698","2a8764dc29","2ac501ca57","2e471f8f43","3298a75087","4a15f7a340","5039cc0b7c","50b7bb5c34","68e44a0502","9776b20475","99b55eef9f","c312ca96fa","cd983af5f3","dcc7984e09"]
grbench_main_art_000051
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["005eb222a3","170b17038d","20e7ce83d3","2df41ad700","2ef9431b33","30b6faff49","33ea31f1bf","48bc188950","4f9d3b5cc6","5f25c46af5","626a6bdff9","67d2eeab46","905fbe78d6","b55711aa87","b9a8ff7e06","c19ac52af2","c23a676fca","ca98a52686","cc70232441","d0945a674f","d97933f1a2","ed97912b9c","eff62fbb72","f327e23aa4","f702ae...
grbench_main_art_000052
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["02cf969e4a","06a422498d","107dca3c76","28eed47366","31ba5eae90","37ff6ebbb5","4343b9f7f0","46ddae6816","51d9fe43b6","5a3919198b","61216eda37","84d8409ea9","9056127c49","a03aafce1c","a93b85715b","b9b0021116","bb0cb2151e","d3d4161691","dc5365c3bf","ffa06fa41a"]
grbench_main_art_000053
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["051f9eb6d4","0ede484134","1654a516a5","275172b4d7","288827bdda","47192600cc","4b51a864e2","53632949a4","5aedcf095b","6e75e76386","7084b25763","9810aea8ca","aa0add5d63","af5e612d81","c471625edf","cb3c669d69","d176753d35","d1b692842d","e53d99fb1f","ed6fd9f761"]
grbench_main_art_000054
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["08630127fd","12984d45ae","1f7bb3defb","24333d343b","3a0dfc3ade","44be341421","462a4a7e65","5c7063853d","62c3f7eef7","6439ec4c83","6d9fb8eba5","78df6a7dc4","7cfa59bf7b","92d542604d","93bdda78d3","9509ecde4f","a46ef99dbc","a5873de204","c60c7af5a0","c7e9753c45","c988181df9","e151fe3729","ee257d0389","f0d503201c"]
grbench_main_art_000055
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0c3db9181d","0e0b0eb937","1656c4072f","18899884b2","1cf409d94b","2af3c65b90","2b8375333c","2eb858001e","55235d1b2e","55eeb09e90","56d2264602","7c89e0c97b","968bf238e8","99e97a1124","9d3f88706e","ae2896cf31","ae296cf9ab","b6f734771c","c16c082e80","c5e8b7797a","dd5b487bd7","fb6aae09e2"]
grbench_main_art_000056
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["01faf54713","06b3d3d3d5","0d5bb85766","0f35eb8133","528a35799f","730d147c2a","7a309ec617","7c443e42cc","8147f87071","86a455d8ca","8a3daee1b6","9969434156","a23906a329","a914d5bb40","ce1fad4da2","d7110dc2c3","dfe50fb1d6","e5399fd4f2","f5f306c051","ff00374038"]
grbench_main_art_000057
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0df69a8cfa","11a02909d3","27bd9004cb","2c013a85c8","4e04cd1f89","56e6e3bd45","6fee1ea358","735c0a3090","89ef33f8a0","940ea367a3","9693f30a17","b24761f54e","b9f2492294","bb8ce4177b","c7d8078036","d6bfbbd511","f695d8217a","f75a55f5cc","fb4b4d1ea6"]
grbench_main_art_000058
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["15237e7d03","1a2fc2a24e","1ecdc88032","2a08f52fb3","375e59606e","46ca686162","48b9e03c97","4f9f990e80","54f730e69f","57278b6139","57d4f851cb","6a5a469c6a","6ec80d3ca1","84be5795e4","8eb4c5b826","91a7dde1ae","9e1ddcd3b2","9e7faf622f","a118c8843e","c4bbc0856e","cd8dc692f2","dfde9a6950","e622002ca9","ee055590db","f2cfd6...
grbench_main_art_000059
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["02cb769875","0380e2e008","2266b3bf1b","2e0dafcfa0","2fdfde0bf3","35e1f5f56b","416f28b904","4ed027a9e5","516c4ca5b8","59b2afa301","5bb211991e","5f685107c5","74bd2ac51d","9c2170d12f","b6b05ac150","b6bba71c8f","c34baec3ed","d590c23d32","dd218c5fc8","f364a870b4","f3fd060792","f89fc23f16","fc32e4b687"]
grbench_main_art_000060
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["025f27cfce","150e41136b","1b85823f4f","22c1eddbfb","27846e61ab","29a597555c","2f0e0c6c12","3540e80c97","3b125885a1","5d4a0050ee","5e9b4e5f6a","67898f800c","7e43a362d9","998e54c7dc","a0096922f2","ad634b01be","bfa49d41d9","d3028da571","e1c151d859","e591118b60","e9f3086b2c","f6c3d3dc70"]
grbench_main_art_000061
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["00f59fccb4","10a9886398","1558472b65","206a9bd55d","219ee6a7e6","2b87908848","3adfc9cd91","428fb6f936","77df7aa966","7883d0c090","7ba331d2c8","a2c933380a","ab59e7b6b5","acc72fa71b","ba1eb6b83f","baaa450917","c20f376146","ca95101a27","e6463b4fe3","fee371ca84"]
grbench_main_art_000062
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["07e9db3006","0aa0f4b249","131a6ac42e","14bc88138a","5defa91dac","60b015304c","68bd44745c","7d59a1e49a","80f58d9a73","8afd2be4fc","8b6360869e","98f9663d76","9ea1b4de41","a4fc1d7220","a56185925c","a9784d95bd","b80dc4cfea","cbcafd198e","db3c8f1e02"]
grbench_main_art_000063
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["18fdc4299f","1a6d418489","1b88665faf","25a1bc7faa","365e64fc4d","3fe6320c33","4448912c6c","60a1d75dfe","79f37c5be9","7ea5cd57ad","9cd96cdddb","ac3000d1a6","be60def880","cfb843399e","d9e797a0cd","e0eac80b34","e7f19318c2","ff302c9faf"]
grbench_main_art_000064
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["008928265b","11a9587318","1bf33e2104","31a655d716","3253e68e4d","57eeb0bc29","592cd07b86","5b06f7845a","5f85ae8a1d","6528724fc4","69bdf8b8fe","7130c84dad","8269ccd1ce","845b2a4171","8e31bad070","a10f8e39c3","bc69203fa3","d2586f2505","e016706ddc","ec9c1f26f4","fd9ec8bc2b","fea000ad0a","fead87d624"]
grbench_main_art_000065
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["02ac7d1260","1b4e56bcd9","1ebfa2aa6a","204bee2a7c","2a8fddeaa4","2b4abb823b","307f7cc55d","474a56bd87","4cb5148e8b","54207d023d","5fee9064c0","724af2d3db","7813cd2b3f","805f5a8d9e","aa59f91288","c08cc91c9b","c87821c89a","d0d1a472c0","d19b51d493","d79e79e4df","e9c8e17883","edf485f3f0"]
grbench_main_art_000066
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["037cd6c684","1bbf19a460","3436c7e171","3aa5998178","3e6065074a","4d40893656","54bf4b656c","55709b746d","6726f6e79d","6797b06086","6eb5a78bd2","7f6f446eff","81dc24ef3a","90b937a092","9abe1235e1","b2f8baf3d3","c44893633a","c48d2b5f6c","c52e2b5483","cf66f2ff51","eda4b16853","f23165770f","f2ede63991"]
grbench_main_art_000067
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["05aa30e8f2","1b9d40f4cc","2fc40bb52f","32dbfc0928","3403d11cd4","3f2846b9dd","443f5073bc","4a655419c0","5656b34f52","5b513f66ff","6bcf983f64","7a14f7f5e4","812bb74b58","975c2da738","ae42ddc620","b811b0ed3e","bf92503368","cd0bb029f7","e566c06dd1","ec98595399","f0b8cbbd01","f9dd4c150c","fc5e76488f","fcf1826b51"]
grbench_main_art_000068
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["02fc5c40a3","098707ec76","20f90ad6af","3ce3b59ed1","3d7265e85e","3dc0c1b2bb","50a9744ffd","523a28f4e3","5640be5ab7","5828a1e388","65bff2274f","69f1f00c4f","89a010b490","8a2e655f63","ba9e1f2f4c","e5d94610eb","f0404832a2","f1ce5e287d"]
grbench_main_art_000069
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["1e4980b664","1e63f72a44","32ec3117cf","45c673e807","4b22a33b1b","4c0153ad39","4d371dbbe1","748a14ec63","771870d0b3","81ad6b4251","8b8bf4820e","8ec3b1eb95","907892630e","a5fe60c120","a97b5b8c7c","acbf825033","bc7d962d15","c0cba5cad8","cbb4f1f988","cf7ef27bad"]
grbench_main_art_000070
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0b7203a68d","181d4e4c4d","2b264cbf4b","50c837d008","559575fac3","62dbc59f73","6de546d0ed","76e3201f1e","82c12d3bd5","966046296e","9b608872b8","a668cd80c9","a98b0b298d","aba16feac6","acf08cd0a0","cbf504b569","e9a1e61bf4","f105c2135b","fb3f3a2616","fe6a08a831","ff1e62cf81"]
grbench_main_art_000071
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["104d82c97c","159837ed70","18e1e8005d","205d354aeb","2104f7dcfc","2a90191668","2e4ff24d89","2f519fa086","47a1c797f8","58614a4caf","5927119686","7ff78336fe","89fc4a7adc","a360a60f30","b18188549e","c14b305eaf","dd6d466c5f","df0c5c538c","e2928ccd5b","e58f3e3a7c","f2e84342fb"]
grbench_main_art_000072
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["276cdaada5","2a895e6215","30634a4302","3c4d92cd61","3dc8a32131","6d79b21147","76c5ff7e5c","8eec7b8630","a1f81d6d50","b569ecbf0a","bba35acbfa","bd7856bb15","ccabc27070","da44834fad","dd5c9a6104","e24c05c35b","e77bab3009","fa6cee58dd","fae1a8c343","fce2974d5f"]
grbench_main_art_000073
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["07c243cd35","1c027fb930","23d7b14270","289b09e74d","2a319fb487","3083352f25","4059429c25","4b60450241","4bb0c7d576","59111635ee","5e54bd60c2","6082a4ee17","696baa7bc6","793fa1956b","7dc83e9c64","9a1521e5bf","ab647a50be","b9b6f96118","bd737cfb62","be64f85b99","be9015a894","cc0204c02f","cfa9b17d68","d015fd071d","f498a6...
grbench_main_art_000074
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["07191ab52e","0ae9f850fc","21f6dcdbf4","28f55dac51","29e233ddb8","2c9efccfa2","2e1bdafab7","2f100a3b8d","32e085ca4b","4b5b46f391","4c6d7d1a90","57a967e348","57d1fa481a","59809a515d","5ef9b30151","6511c1e5fe","67ecfe3363","71124a61b0","81f4bc7a3b","8c96cf7559","a1a37ea7bf","a34e858d87","b095d8d4fb","b990d2965c","d3c3a7...
grbench_main_art_000075
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["498335e2f3","5211fa02de","5229de8d52","6292fd892d","6910c2a5da","69e9a879d7","79ec7cbf01","7bc263997d","84dd791dc5","864773d788","94a2859372","959743d01d","9a03382ca8","b68fddf1a2","bb44b29b50","d2ef5e15d9","d408a85b30"]
grbench_main_art_000076
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["077bafa6a3","1aa5da71b2","1dde47b54d","380b08bd78","3b1c97a676","464f83615d","51ff63b4bb","570ce6e8af","66e899b084","67f7199385","86082ba5c5","992d336d47","9fc3f95093","ab87252d40","b0afacab0c","c4264779d2","cb952359fe","cd2d99b02f","cea9e82973","d09d1a41e6","de909570f3","e3471f1689"]
grbench_main_art_000077
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["118ba571b6","12ad4dc5e9","1a4ff71ee4","23183c82e4","2728edf520","28dade3f97","32aef4f320","36942f6dad","3e05a60fdd","5067662bc4","5abdb32149","6d39e44cfc","78510da219","7a89a4d099","7df1bb4838","a1906111d0","a535022c3f","ae075a2e8b","aeb40e0000","afbf52c149","b55a6e9086","be12355f0d","c2aef32cfc","e75e0eb9ca","f10c1a...
grbench_main_art_000078
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["014717a9f0","179043aa69","286082f2d5","2e02f50a42","2f4db78b16","3b8d721428","43ed48665a","451ad425cc","4816696bc6","79b079c14c","8db73d70c3","948dba8b87","a4f16da18f","a73306288c","be5b9f9cc2","c00e048b31","c0cfc914a8","c825427800","ca0e5c995c","d1b3d032d9","d29997ce56","d8f645f7d3","ed6124162b","f7ce79b0ce","fb89d4...
grbench_main_art_000079
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["10da7359ed","3d9bea9cab","4b8253d5a0","535140443d","54bf1b17d1","752445c90f","7bad38396a","7c51d8a838","8692ca4fb1","88955ba646","8b388793fb","924e1fa959","9672382651","991f774b78","99b705b44f","af0648b346","bd2d9b223a","c0fc26fdbb","c539719dc9","c56637276c","d90b7735b8","d99eff92ee","dd97cdc059","f0adf4e630","f80739...
grbench_main_art_000080
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["03f6a70bf9","08e230f053","334f72caa4","38b6594d93","3b0cadf5f0","56c2c53d56","6352c6c160","6c43eafbbe","739362b68e","7c7b0b5e40","99e7d32659","a3e79807c5","abbfaa0680","cbcc73acc5","d424d0b3f5","e0e42d8a78"]
grbench_main_art_000081
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0312e61536","04548a2c21","1aa6511a57","215836b3aa","25b8ccd8f3","2f518fea33","3561049c62","3a16731461","3cd60468df","423e5f21c5","47ebc3b5a5","8f34b1ecd6","916dc3fd21","c06d2ae472","c4a762984a","c63666d945","c794b04283","d3f89514cf","dc4caa5a91","e7635e100d","e8b3ef6acb","ebe432e98b","ed3c416aac","f35c960939","f964fb...
grbench_main_art_000082
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["076f611c5d","0f527a5fde","1116e27d6d","122d5b2cd5","213f645180","2b6554f914","2f22d80839","338e8db186","35e1e057fa","450f03a6c1","51a8914ac0","8c6644ccf4","945fd849ed","96989197c0","98e20d3d60","999f453712","9e20f7d8c1","ab50adc776","b0971f465f","bbc7b9e37d","d3bda8b4f6","e89fec7dac","efeffae38d","fa2689c7c2"]
grbench_main_art_000083
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["07c20122cc","085f30a339","1c755c4516","2aef2415d8","324c71fdf5","3f9cba3ae3","3fca5ac876","44525306b7","4c631c75db","4df732f021","51f5a58cd6","5325b376cc","71f0dbb0e7","84e7e7b8b1","a38b5c892f","a8b8407d2f","b387bccb70","c708d0a0a9","e8a499d2b4","eee25c5a4f"]
grbench_main_art_000084
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0f53459a13","18b08fe4af","267f8320d6","26b2626a66","2e9edd4d9d","35432c8d73","3dfeb16f58","4f222db2bc","5080ff1408","533367ca40","5daf094313","6bd4ec5ef4","83f7d09c3a","8db80eb89f","9bd1916b83","9ce7046c86","a775decb3e","c40a55bed2","d816ae8f65","eb7e0c0310"]
grbench_main_art_000085
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0bbeb669d3","18e9c91c4a","1b0f07fa7d","2c8d1bb5f3","4013f51bc7","4529f3045e","562f23b6e1","585b484f10","5d0eae8547","643b9bf011","66512c2c87","6a40c2f424","8225c3701b","916f666ac4","9dee8f9870","bbd79b3b4d","be946ec1f4","c11c22eb70","c561475497","c9f509190a","d2af41cfae","d778abe956","e3a456cf59","ff1e09ae6d"]
grbench_main_art_000086
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["06ba3967ac","10d1ad528a","1f01f52f30","2af90945a9","4022e6d2a7","409816958e","42b751ba30","433b535ae0","4a5b8cb095","4fa30adf60","604a8eba7c","94502ad3ae","ac1fb49346","ad77cfdadc","ae7bd78845","b11c76e2e5","c15b4b732b","c3692ef844","d9a4718229","dceb53bd93","eba99f09ca"]
grbench_main_art_000087
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["218e08e8cb","32ea44d70e","3d7d18f702","57d00172d3","668094deae","758e358190","a48c76c205","bc459a16b6","c1e91f50e7","c63c09625d","cb1fc09515","ccfbb6f265","d48db9b6cb","dd22b966ef","de485be7c1","dfe37095f9","ececd701bc"]
grbench_main_art_000088
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0bd8793e6e","196c427fa2","373e0fef95","415b8c4bb5","46bd75c45a","4cae841e0a","652d502741","67ac5074ed","79f0068803","7ea8a08206","a022d76eed","a66e756e72","aa09e9f212","b69b7677d9","ba4f7dd110","bca5ab6720","bee2bbb7a9","c22a126e04","cd488882f0","d1c29eaac5","da09714758","dd98c3ea8f","eeca80b6ea","f287d6c85c","f6a5a5...
grbench_main_art_000089
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["093b019e5e","1dd8a68e52","24c07b687f","2908dc4f50","348016ce72","35d4b3f1d9","39a78b8ab7","4bd97f374a","4d9664ce99","4fc679ec39","58d347dd6d","5dcba05407","760e558a07","888c8f061f","89658ec56b","99f61ed3c5","a70c0eb5ba","bf572b99ff","bf7f919c59","c6ff2fb7ab","ca7b8c1b94"]
grbench_main_art_000090
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["02970af66f","03aa1e6710","07dbd7e913","1ebfd43583","2215b14953","359dd1ab9f","420c2f2779","4a121b7452","52e5c8af92","5c19bbc86f","6ab9514e2d","7d174f3436","8dba791acf","a0b9cf57e4","a496f8715e","bf7506a322","c6ae401ffc","d04ec1d6ab","d2dfb22bc5","d55f52172d","d68eff50d9","ee01510fda","fe5f44a61e"]
grbench_main_art_000091
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["07f9e8cc7f","0bf3616c22","1735f1dbda","26ca6f712e","3b079e5024","3eead12d83","43ad15a86b","43cdad85eb","4cf49e4b0f","54d04e7d9b","588063ef9b","655394720c","8d82bf2823","921fa51a53","9f091379dc","c09fd784d6","c337825c31","c5e7a72091","c8cf234d8c","d67533fd6a","ed9ce5b16f","f27889d83c"]
grbench_main_art_000092
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["2da15b5310","4bd5e38fcb","4c986d0d97","563470b420","67c508fd43","74d9c7b32c","77320d9a60","873a3413d5","8f91058ca0","910b243f47","99b2e81d98","9ad42c8877","a8aa4fb1c2","b60b186bb5","c2e88c32a7","c670fce078","c83eb2f918","c912a91636","f000023708","ff1cc158b7"]
grbench_main_art_000093
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["019a378524","0f5c29b15f","1b48dce830","297ee1a53b","2a8852648b","3ed2e54d27","57142101de","64db5654c7","6f4a15c7df","7799255011","8d2d205dfc","974f9118dc","b8908ee40f","bcd02a6654","c5079c026f","c651221dab","d3334b2f94","d6f4430590","daedcd4f62","e729006a67","eb83fb6eaf"]
grbench_main_art_000094
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["03a2011e37","04198a133c","0cd89a0884","0de45829a6","0eb73e59e1","130b32a383","5155245413","5222b928fd","6298f0fec1","7b748b1975","7e6b89cc01","85c791bb95","8bef18cf87","8e19358677","b09f260983","b1a32fadb9","b77714e39e","c1aef3104c","c6532122e9","c923209957","caeee17437","d0d3b7c2f6","d857fa89f1","f5e7fd4991","f6f331...
grbench_main_art_000095
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0e8e88165e","1ad95be279","1c5985da5b","20d6c776c6","39887fc8eb","3f30debbca","43c05b76fa","55ec53586e","5708f8b9eb","9246346c68","94403915e5","96f481aec1","9c7d6c59f1","acda7bcd90","b6ea5a48d7","c7b13ad437","c9f0ff5b8f","cfe77d5f67","dab169eb25","e1f0a22f89","e9b9e1ba35","f327808031","f50521b003"]
grbench_main_art_000096
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["038ed19045","2717c5191c","2eca91f595","430f433273","440f992de4","50677df19b","5b7ffca34b","69aeeefeac","72dc3a05f2","899b2cfd78","a7d58f031a","c2093956f3","c4c786105c","c77e5ae1fd","d0daf132c2","d96c4bde22","d9be2cebaf","e4988c91a7","e8e4f6d428","f7ce0818ea","fc61b61360","fceffd5c59","fd45c48caa"]
grbench_main_art_000097
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["04a1f3abeb","064fde7064","166d0182d3","4c50575a00","594ac07e03","63e8aaa7e5","69b426b27f","6aedc9b43c","77d3566f71","7eafde4fd0","8aeb18de8d","8f6a48d512","91654ccabe","aed9cf0c3b","bc47b73558","be43f064b5","c3860799d3","ccd16988c7","ceb30f28c4","d3a08db9d8","ddd824a7cd","e19e46cd60","f8d770ba8b"]
grbench_main_art_000098
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["0f04c3bda8","1044e4ea72","1556dfc016","1aa6204eed","2db45cec00","2dd4dd8b05","321919d11d","37a125b67b","42bf69f9cf","4de58882d3","52ac4ddc00","7462d9bbd5","8781cb4c5d","887084c9c0","95b61e062c","a881b32dec","a91507b138","abe89fd83b","b2cb3ee1d9","c0c91a3b22","c0f57758c9","c27192e956","cab209e959","d4a29f4f01","f1d5db...
grbench_main_art_000099
ART
You will be given a graph as a list of undirected edges. All nodes are at least degree 1. You will also get a description of an operation to perform on the graph. Your job is to execute the operation on the graph and return the set of nodes that the operation results in. If asked to find articulation points, only retur...
["1315420c4f","19e1be57bc","220c19dd5e","256422c4fe","2873e8e51e","29c6138887","30da93d6d4","314f8eb94b","481aa773b6","5fa5190bb2","64784f1369","6964c2e5c7","72aabb9f7e","74b13d4a93","80adeaf887","82052e3fed","a9fd37d5ac","adb9c2aee1","aea4187cb1","b19aafc063","c08435dd90","c2dffcd73d","cf0516c96c","d0cccb2487","d0f542...