I hereby claim:
- I am voronoipotato on github.
- I am voronoipotato (https://keybase.io/voronoipotato) on keybase.
- I have a public key whose fingerprint is B07E 9524 F29A EBE1 2295 733B DBB5 64B4 2721 C45E
To claim this, I am signing this object:
/* | |
* Copyright (c) 2010 Tobias Schneider | |
* This script is freely distributable under the terms of the MIT license. | |
*/ | |
(function(){ | |
var UPC_SET = { | |
"3211": '0', | |
"2221": '1', | |
"2122": '2', |
I hereby claim:
To claim this, I am signing this object:
""" Pathogen Settings | |
filetype off | |
call pathogen#infect() | |
syntax on | |
filetype plugin indent on | |
""" End Pathogen Settings | |
""" Airline Settings | |
set laststatus=2 " statusline appears even without page split | |
""" End Airline Settings |
BEGIN | |
IF age < 7 AND clean = 'Poor' OR 'FAIR' THEN | |
UPDATE flight_info SET cleaning = 'Y'; | |
ELSE | |
UPDATE flight_info SET cleaning = 'N'; | |
END IF; |
The range sliders at the top change the values for the force-directed algorithm and the buttons load new graphs and apply various techniques. This will hopefully serve as a tool for teaching network analysis and visualization principles during my Gephi courses and general Networks in the Humanities presentations.
Notice this includes a pretty straightforward way to load CSV node and edge lists as exported from Gephi.
It also includes a pathfinding algorithm built for the standard data structure of force-directed networks in D3. This requires the addition of .id attributes for the nodes, however.
Now with Clustering Coefficients!
Also, it loads images for nodes but the images are not in the gist. The code also refers to different network types but the data files on Gist only refer to the transportation network.
Adapting the earlier OSM vector tiles example to show how to render multiple layers.
<!DOCTYPE html> | |
<meta charset="utf-8"> | |
<style> | |
.axis line { | |
fill: none; | |
stroke: #ddd; | |
} | |
body { |
Latency Comparison Numbers | |
-------------------------- | |
L1 cache reference 0.5 ns | |
Branch mispredict 5 ns | |
L2 cache reference 7 ns 14x L1 cache | |
Mutex lock/unlock 25 ns | |
Main memory reference 100 ns 20x L2 cache, 200x L1 cache | |
Compress 1K bytes with Zippy 3,000 ns 3 us | |
Send 1K bytes over 1 Gbps network 10,000 ns 10 us | |
Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD |
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.