Changing the value in the Seed field will generate the corresponding input to the Input field.
Pressing the Download button will download the inputs for seed values seed, seed+1, ..., seed+#cases-1 at once.

By running your program locally against the generated input and pasting the output of your program into the Output field, the visualization results will be displayed.

The simulation results for query number k are drawn. The following methods exist for specifying the query number k.

• Drag and drop the memory on the bar
• Changing the number next to the bar
• Clicking on a number in the Result table

The Result table displays in blue the predictions that match for the kth query, and in red the ones that do not.

The following is a description of each item in the right section of the screen.

• M: The given number of output graphs
• ε: The given error rate
• N: Number of graph vertices entered
• k: Query number
• s[k]: The source graph number of H[k] (correct No.)
• t[k]: Predicted value of s[k] (input No.)
• h[k]: Given graph
• h'[k]: Unshuffled vertices of the given graph
• g[s[k]]: The source graph of H[k]
• g[t[k]]: The input predictive graph
• #v[k]: comment #v
• #g[s[k]]: g[s[k]] comment on output
• #[k]: Free comment

The description of each drawing option item is as follows.

• visualize mode: Whether graphs are drawn or not
• layout: Specify the layout for drawing graph
• clustered: Draws edges as springs
• circular: Draw vertices circumferentially
• hierarchical: Vertex is drawn hierarchically
• radial: vertices are drawn radially
• matrix: Adjacency matrix table, matrix order is correct order, or specified order when v[k] is specified

Draws a graph at the bottom of the screen according to the kth query. From left to right: the given graph H[k], the correct graph from which h[k] is generated, and the input predictive graph G[t[k]].
*Graphs with large N may take a long time to draw. In particular, we have confirmed that layout: circular cannot be fully drawn when N is large.

The vertices of each graph are placed at the same position based on H[k] as much as possible. H[k] is drawn as the difference from the original G[s[k]], with solid blue lines indicating added edges and dashed red lines indicating removed edges. H[k] has no vertex numbers by default. #v[k] will have vertex numbers accordingly, and the vertices will be painted in blue if correct or red if incorrect.