Deven Bhooshan
Deven Bhooshan
Should close #21
Prim's Algorithm assumes the graph to be undirected but in msp.js graph is not undirected . https://github.com/devenbhooshan/graph.js/blob/master/test/js/msp.js#L15
`node1.adjList[0][0]` -> node adjacent to `node1` at index 0. `node1.adjList[0][1]` -> weight of the edge from `node1` to `node1.adjList[0][0]`
There should be something like `graph.addEdgeBetween(node1,node2)`. It is needed because we have `graph.removeNode(node)` to remove any node from the graph.But somebody can do `node2.addEdge(node1)` after doing `graph.removeNode(node1)`.