Athan kgryte

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.

	#include "stdio.h"
	#include "stdlib.h"
	#include "sys/time.h"
	#include "time.h"

	extern void dgemm_(char, char, int, int,int, double, double, int, double, int, double, double, int*);

	int main(int argc, char* argv[])
	{
	int i;

	#include "stdio.h"
	#include "stdlib.h"
	#include "sys/time.h"
	#include "time.h"

	extern void dgemm_(char, char, long, long,long, double, double, long, double, long, double, double, long*);

	long main(long argc, char* argv[])
	{
	long i;

	//Copyright (c) 2011 ashelly.myopenid.com under <http://www.opensource.org/licenses/mit-license>

	#include <stdlib.h>

	//Customize for your data Item type
	typedef int Item;
	#define ItemLess(a,b) ((a)<(b))
	#define ItemMean(a,b) (((a)+(b))/2)

	typedef struct Mediator_t

	BIN = ./node_modules/.bin
	SRC = $(wildcard src/*.coffee)
	LIB = $(SRC:src/%.coffee=lib/%.js)

	build: $(LIB)

	lib/%.js: src/%.coffee
	@mkdir -p $(@D)
	@$(BIN)/coffee -bcp $< > $@

	import numpy as np
	import scipy.linalg.blas

	cdef extern from "f2pyptr.h":
	void *f2py_pointer(object) except NULL

	ctypedef int dgemm_t(
	char transa, char transb,
	int m, int n, int *k,
	double *alpha,

	// Linear Congruential Generator
	// Variant of a Lehman Generator
	var lcg = (function() {
	// Set to values from http://en.wikipedia.org/wiki/Numerical_Recipes
	// m is basically chosen to be large (as it is the max period)
	// and for its relationships to a and c
	var m = 4294967296,
	// a - 1 should be divisible by m's prime factors
	a = 1664525,
	// c and m should be co-prime

	#include <stdio.h>
	#include "cblas.h"
	#include "lapacke.h"

	int main(int argc, char* argv[])
	{
	int* ipiv;
	int info;
	int i, j;
	int n;

	var svg = document.getElementById('graph'),
	xml = new XMLSerializer().serializeToString(svg),
	data = "data:image/svg+xml;base64," + btoa(xml),
	img = new Image()

	img.setAttribute('src', data)
	document.body.appendChild(img)

	// Language is OpenGL ES, but gist.github.com doesn't know that language
	//
	// Approximation is based on multiply/accumulate, because thats the only
	// thing Videocore can do quickly!

	precision highp float;

	float sinf(float x)
	{
	x*=0.159155;