I understand that the number of edges to calculate grows O(n²) with nodes, so complexity increases quickly for users with lots of friends, but I'm wondering if

I'm pretty new to programming and very new to JavaScript, so I'm sure I'm making some mistakes. The relevant code is included below.

I understand that the number of edges to calculate grows \$O(n^2)\$ with nodes, so complexity increases quickly for users with lots of friends, but I'm wondering if:

I'm pretty new to programming and very new to JavaScript, so I'm sure I'm making some mistakes.

I've been learning Python for about a year and now I'm trying to improve my Javascript. I wrote this simple d3 visualization that shows your Facebook friends as a force-directed graph. Here's a live version and here's the source on Github. It works well, but it can be slow.

I understand that the number of edges to calculate grows O(n^2) with nodes, so complexity increases quickly for users with lots of friends, but I'm wondering if

1. there are any obvious optimizations I could make,

2. what bad habits I might be importing from Python, and

3. how I might tweak the layout parameters to reach equilibrium faster.

I'm pretty new to programming and very new to Javascript, so I'm sure I'm making some mistakes. The relevant code is included below. Thanks!

I've been learning Python for about a year and now I'm trying to improve my JavaScript. I wrote this simple d3 visualization that shows your Facebook friends as a force-directed graph. Here's a live version and here's the source on GitHub. It works well, but it can be slow.

I understand that the number of edges to calculate grows O(n²) with nodes, so complexity increases quickly for users with lots of friends, but I'm wondering if

1. there are any obvious optimizations I could make

2. what bad habits I might be importing from Python

3. how I might tweak the layout parameters to reach equilibrium faster

I'm pretty new to programming and very new to JavaScript, so I'm sure I'm making some mistakes. The relevant code is included below.