(node)
| 5502 | } |
| 5503 | } |
| 5504 | function depth(node) { |
| 5505 | var children = node.children, d = 0; |
| 5506 | if (children && (n = children.length)) { |
| 5507 | var i = -1, n; |
| 5508 | while (++i < n) d = Math.max(d, depth(children[i])); |
| 5509 | } |
| 5510 | return 1 + d; |
| 5511 | } |
| 5512 | function partition(d, i) { |
| 5513 | var nodes = hierarchy.call(this, d, i); |
| 5514 | position(nodes[0], 0, size[0], size[1] / depth(nodes[0])); |