Skip to content

Commit baff01e

Browse files
v1.0.2
1 parent d9ab722 commit baff01e

File tree

4 files changed

+13
-12
lines changed

4 files changed

+13
-12
lines changed

bower.json

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
{
22
"name": "aureooms-js-gn",
3-
"version": "1.0.1",
3+
"version": "1.0.2",
44
"description": "graphs and networks code bricks for JavaScript",
55
"homepage": "https://aureooms.github.io/js-gn",
66
"license": "AGPL-3.0",

js/dist/gn.js

Lines changed: 10 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -1962,11 +1962,11 @@ var sparse_graph_t = function(){
19621962
/**
19631963
* Object constructor
19641964
*
1965-
*
1965+
*
19661966
* The main entry points in the graph object are the two dummy nodes [beg] and [end].
19671967
* Those allow us to write more generic code by handling corner cases implicitly.
19681968
* They allow the addition of a single vertex to the graph in O(1).
1969-
* Remark : Indeed the behaviour we want to get is the behaviour of a dll (doubly linked list).
1969+
* Remark : Indeed the behaviour we want to get is the behaviour of a dll (doubly linked list).
19701970
*
19711971
*
19721972
* vertices are small arrays where
@@ -1979,14 +1979,14 @@ var sparse_graph_t = function(){
19791979
* For the set vertices that have not been removed from the graph,
19801980
* we define the 'youngest' vertex as the most recently added vertex of this set
19811981
* and we define the 'oldest' vertex as the least recently added vertex of this set
1982-
*
1982+
*
19831983
* Invariants
19841984
* ==
19851985
*
19861986
* Given the graph is not empty:
19871987
* > [end][1] = pred of end = the youngest vertex
19881988
* > [beg][2] = succ of beg = the oldest vertex
1989-
*
1989+
*
19901990
* Given a vertex v
19911991
* > v[1][2] = succ of pred of v = v
19921992
* > v[2][1] = pred of succ of v = v
@@ -2007,11 +2007,11 @@ var sparse_graph_t = function(){
20072007
/**
20082008
* Prototype method to add a vertex to the graph with label h.
20092009
* <p>
2010-
* The graph is extended
2011-
* @param h is the label
2010+
* The graph is extended
2011+
* @param {label} h is the label
20122012
*/
20132013

2014-
graph.prototype.vadd = function(h){
2014+
graph.prototype.vadd = function ( h ) {
20152015

20162016
// First the vertex is created and appended at the end of the dll.
20172017
// Remember [end][1] was the previous last element
@@ -2033,7 +2033,7 @@ var sparse_graph_t = function(){
20332033

20342034
this.eitr(i, function(e) { this.edel(e); });
20352035

2036-
2036+
20372037
i[1][2] = i[2]; // next of pref becomes next
20382038
i[2][1] = i[1]; // prev of next becomes prev
20392039

@@ -2120,7 +2120,7 @@ var sparse_graph_t = function(){
21202120

21212121
};
21222122

2123-
2123+
21242124
graph.prototype.aeend = function(){ return this.eend; };
21252125

21262126

@@ -2130,4 +2130,5 @@ var sparse_graph_t = function(){
21302130
};
21312131

21322132
exports.sparse_graph_t = sparse_graph_t;
2133+
21332134
})(typeof exports === 'undefined' ? this['gn'] = {} : exports);

0 commit comments

Comments
 (0)