Research Article

A New Graph Drawing Scheme for Social Network

Algorithm 2

Hierarchical compression algorithm.
Input: Graph oriG;
Output: Hierarchical graphs after compression
hierGraphs.push(oriG);
while(hierGraphs.topG.nodes.size > tN)
ā€‚ newGcompressGraph(hierGraphs.topG);
ā€‚ hierGraphs.push(newG);
returnhierGraphs;