Force Directed graphs/networks are obtained by using the Force-directed graph drawing algorithms which is mainly based on the forces assigned among the set of nodes and edges of a graph.The forces can be either attractive which is used to attract pairs of endpoints of the graph's edges towards each other or repulsive which is used to seperate all pairs of nodes.
The force directed graph/network visualization of more than 2000 nodes takes lot of time and hence degrades the overall performance
In order to optimize the performance in terms of the time taken to visualize a large network of more than 2000 nodes,we can use web workers.Web workers are mainly based on the concept like parallel processing in web.They work by splitting the tasks across different workers without affecting the actual UI.