Q1. (a) Briefly introduce how Force-directed algorithms encode networks.
(b) In force-directed placement, does spatial proximity (visual clump) always indicate grouping/ community? Explain.
(c) One of the weakness of force-directed placement is that the layouts are often nondeterministic. What does it mean?
(d) Illustrate the scalability issue of force-directed placement briefly.
Q2. (a) How does adjacency matrix encode networks?
(b) Give an example of matrix view of a network that's not from the textbook and explain what it is. You need to include the reference if the answer is found online.
Q3. (a) How does treemaps encode trees?
(b) Given an example of Treemap layout that's not from the textbook and explain what it is. You need to include the reference if the answer is found online.