An undirected graph is described in the adjacency matrix below.
1 2 3 4 5 6 7 8 9 10
1 0 0 1 0 1 0 1 0 0 0
2 0 0 1 0 0 0 1 0 1 0
3 1 1 0 0 0 1 0 1 0 0
4 0 0 0 0 0 1 1 0 1 0
5 1 0 0 0 0 0 1 1 0 1
6 0 0 1 1 0 0 0 0 0 1
7 1 1 0 1 1 0 0 0 0 0
8 0 0 1 0 1 0 0 0 0 1
9 0 1 0 1 0 0 0 0 0 0
10 0 0 0 0 1 1 0 1 0 0
Without the help of any automated graph layout tool, design a node-link visualization for the graph that shows the node number (1 through 10) and the connections between nodes. Note that a general drawing program such as Paint or PowerPoint could be used as long as it is not meant to automatically position the nodes and draw the edges of graphs. Neat hand drawing could also work. Try to design interesting graph representations, try to find interesting patterns to show. Most importantly, try to make the graph conform to the goals stated in class (see “Goals for graph drawing” slide: reduce intersection, reduce length variations, and reduce bends). It may be impossible to satisfy all goals equally.
Submit: the graph visualization - must have nodes and links, and one optional paragraph outlining your strategy for depicting the graph.
A zero should be given if not all nodes and links are included or incorrect edges appear in the graph (10 point deduction otherwise; 20 points for multiple occurrences). The criteria should consider first the three goals for graph drawing, then the clarity of the graph.