undirected unweighted graph

Author: chen0040

README.md

@@ -1,2 +1,4 @@
 # js-graph-algorithms
 Package provides javascript implementation of algorithms for graph processing
+
+[![Build Status](https://travis-ci.org/chen0040/js-graph-algorithms.svg?branch=master)](https://travis-ci.org/chen0040/js-graph-algorithms) [![Coverage Status](https://coveralls.io/repos/github/chen0040/js-graph-algorithms/badge.svg?branch=master)](https://coveralls.io/github/chen0040/js-graph-algorithms?branch=master) 

src/jsgraphs.js

@@ -1,8 +1,21 @@
 var jsgraphs = jsgraphs || {};
 
 (function(jss){
-	var Graph = function () {
-        
+	var Graph = function (V) {
+        this.V = V;
+        this.adjList = [];
+        for (var i = 0; i < V; ++i) {
+            this.adjList.push([]);
+        }
+    };
+    
+    Graph.prototype.addEdge = function(v, w){
+        this.adjList[v].push(w);
+        this.adjList[w].push(v);
+    };
+    
+    Graph.prototype.adj = function(v) {
+        return this.adjList[v];  
     };
 
     jss.Graph = Graph;

test/chi-square-distribution-spec.js

@@ -0,0 +1,26 @@
+var expect    = require("chai").expect;
+var jsgraphs = require("../src/jsgraphs");
+
+describe("Create various types of Graphs", function() {
+  describe("Create unweighted undirected graph", function() {
+    var g = new jsgraphs.Graph(6);
+    g.addEdge(0, 5);
+    g.addEdge(2, 4);
+    g.addEdge(2, 3);
+    g.addEdge(1, 2);
+    g.addEdge(0, 1);
+    g.addEdge(3, 4);
+    g.addEdge(3, 5);
+    g.addEdge(0, 2);
+    it("should has 6 vertices", function() {
+    	expect(g.V).to.equal(6); 
+    });
+    it("should be undirected", function() {
+        expect(g.adj(0)).to.contains(5);
+        expect(g.adj(5)).to.contains(0);
+    });
+  });
+
+
+
+});