The document discusses force-directed algorithms for encoding networks, highlighting how spatial proximity may not always indicate grouping. It addresses the nondeterministic nature of force-directed layouts and mentions scalability issues. Additionally, it covers adjacency matrices for network representation and treemaps for encoding trees, along with illustrative examples of each.

1. Q1. (a) Briefly introduce how Force-directed algorithms encode networks.
(b) In force-directed placement, does spatial proximity (visual clump) always indicate grouping/
community?
(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. How does adjacency matrix encode networks? Give an example of matrix view of a
network.
Q3.How does treemaps encode trees? Given an example of Treemap layout.