prompt stringlengths 2.28k 7.02k | ground_truth stringclasses 810
values |
|---|---|
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, S, F, C}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, C, C}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, S}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.1, 0.2, 0.3, 0.4} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, C}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, C, F, F, C}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {S, F, C, F, C}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {S, C, F, C, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, C, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {C, C, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {S, F, F, F, C}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, C, F, C}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {C, C, C, S, S}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {C, C, C, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {C, F, C, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {S, F, F, C, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {S, C, F, S, S}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, C, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.1} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, C, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, S, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, C, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, C, C, F, C}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, C, F, F, C}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {C, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, S, F, S}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, S, C, F, C}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, C, F, C, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {C, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, C, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {C, F, C, C, C}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {S, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, C, S, C}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {C, C, C, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {C, C, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, S}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {S, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {C, C, F, C, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, C, F, F}{0.1, 0.2, 0.3, 0.2, 0.4} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {S, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {C, F, C, F, C}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
You are an expert in graph reasoning. Given a microfluidic bio-chip graph, a set of fluid transportation tasks on the chip and several candidate control schemes, your only task is to classify each control scheme as:
- F (infeasible) if the start or end node of any fluid transportation task is located in the unavailable... | {F, F, F, F, F}{0.1, 0.2, 0.3, 0.4, 0.5} |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5