# Using graph visualization with code.

This visualization is one of ﬁve that was used as a mini-tutorial in a Data Structures III class. Last year was the ﬁrst time it was used and students were encouraged to use it as basis for creating visualizations of their own. Time was limited, so this year I allocating more time to help the students devise their own animations.

On the introductory page, the deﬁnition of the algorithm is presented and then its characteristics are listed. In the animation, two different views of the algorithm are presented to illustrate the execution of Dijkstra's algorithm.

The animation includes a demo of how the algorithm works with related code and then students can create their graphs, weights and edges and run the algorithm with related code appearing. The instructions given are below

There are four other visualization on this site that can be used similarly.

I found that the students were interested but that I needed to spend more class time explaining visualization development.

Is the focus of your exercise to get students to develop an AV (and you show them an example)? Or is it to get students to use an AV to learn this algorithm?

In reply to your question:

I intended at ﬁrst to just use the visualization to illustrate the algorithms but now I am focusing on getting them to do visualizations in my advanced (Data Structures III ) class. I am giving an open project this term and will go over

each of the visualizations and explain what each will require in terms of expertise and time. Mostly, it will give them ideas on how to develop their own animations. The biggest hurdle with an open project is getting them started!

Please let us know how it works out!