text stringlengths 1.46k 24.9k |
|---|
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
<s>[INST] <<SYS>>
You are an assistant that is given a list of change graphs in an edge format. That is, the graph is given edge by edge. The graphs are directed, labeled graphs. An edge is serialized as
"e src_id tgt_id edge_label src_label tgt_label"
Labels are dictionaries. If a node appears in more than one edge, ... |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 12