Skip to content

Instantly share code, notes, and snippets.

Keybase proof

I hereby claim:

  • I am dguilak on github.
  • I am dlak (https://keybase.io/dlak) on keybase.
  • I have a public key ASAfRSm0Bm_kCJKuqy7X-xAckB8jTHcOJCCspxhkWwpF6wo

To claim this, I am signing this object:

@dguilak
dguilak / README.md
Created February 9, 2013 23:29 — forked from mbostock/.block

This example builds a random tree using the Reingold-Tilford "tidy" algorithm, as described in "Tidier Drawings of Trees" and implemented by d3.layout.tree. As each node is added to the graph, it enters from the previous position of the parent node. Thus, the existing nodes and the new node transition smoothly to their new positions. The animation stops when 500 nodes have been added to the tree.

@dguilak
dguilak / installing_express_socketio.sh
Created September 23, 2011 00:56 — forked from isaacs/node-and-npm-in-30-seconds.sh
Installing node.js, npm, express
#!/bin/bash
npm install -g express socket.io #installs express server (expressjs.org) and socket.io
cd ~/sandbox
express express-test && cd express-test
npm install -d #resolve dependencies
node app.js #runs test server with node
#point browser to localhost:3000 (default) -- should see welcome message