A New Graph Drawing Scheme for Social Network

Algorithm 1

Community partition algorithm.

Input: Graph  𝑔

Output: New graph after Community partition

compressGraph(Graph  𝑔)

for each  𝑒  in  𝑔, do

u_e.node1; v_e.node2;

// Compute the single neighbours, 3-circles common neighbours and 4-circles common neighbours of  𝑢  and  𝑣.

computesES(𝑒);

maxESmax(Set(ES)); minESmin(Set(ES));

thresholdcomputeThresh(maxES, MinES);

filterLowEdges(𝑔, threshold);

computeComponent(𝑔);

  for each component in g.components

 newNodecompSubG(𝑐); newG.add(newNode);

 newG.addEdges();