Task Type 1 Select a Task Are the two highlighted nodes directly connected? Can you get from one of the highlighted nodes to the other with exactly 2 steps? Are the three highlighted nodes directly connected? Can you get from one of the highlighted nodes to the other in at most 3 steps? How many nodes can be reached in one step from the highlighted node? What is the maximum number of nodes connected to one of the two highlighted nodes? Is there an adjacent node that contains the letter B? How many adjacent nodes contain the letter B? Find the number of nodes on a given path starting with a letter Find the number of nodes starting with a letter on all paths between 2 nodes Select the most connected node

Number of Task Type 1 Questions

Time In Seconds for Task Type 1 (Enter 0 for unlimited)

Task Type 1 Select One Rate the easiness of the visualization tasks from 1-Not easy to 5-Very Easy What problem did you have with the visualization? Do you have any comments about the visualization? Rate easiness of using the interactive techniques Rate helpfulness of the interactive techniques to tasks Have you worked with this type of visualization before? How will you rate your familiarity with this type of visualization prior to this study? Please enter your Mechanical Turk ID


When should Task type 1 be asked? Select One Before quantitative tasks After quantitative tasks