@wemap/geo 0.3.1 → 0.3.3
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/package.json
CHANGED
|
@@ -12,7 +12,7 @@
|
|
|
12
12
|
"directory": "packages/geo"
|
|
13
13
|
},
|
|
14
14
|
"name": "@wemap/geo",
|
|
15
|
-
"version": "0.3.
|
|
15
|
+
"version": "0.3.3",
|
|
16
16
|
"bugs": {
|
|
17
17
|
"url": "https://github.com/wemap/wemap-utils-js/issues"
|
|
18
18
|
},
|
|
@@ -31,5 +31,5 @@
|
|
|
31
31
|
"lodash.isnumber": "^3.0.3",
|
|
32
32
|
"lodash.isstring": "^4.0.1"
|
|
33
33
|
},
|
|
34
|
-
"gitHead": "
|
|
34
|
+
"gitHead": "837cec0c81359340e7205ebec13e0d1312c94dd4"
|
|
35
35
|
}
|
package/src/graph/GraphRouter.js
CHANGED
|
@@ -76,6 +76,11 @@ class GraphRouter {
|
|
|
76
76
|
|
|
77
77
|
const path = this.getShortestPathInternal(start, end, acceptEdgeFn);
|
|
78
78
|
|
|
79
|
+
let route;
|
|
80
|
+
if (path && path.length !== 0) {
|
|
81
|
+
route = Itinerary.fromNetworkNodes(path, _start, _end);
|
|
82
|
+
}
|
|
83
|
+
|
|
79
84
|
if (endNodeCreated) {
|
|
80
85
|
this.removeNodeFromPreviouslyCreatedEdge(endNodeCreated);
|
|
81
86
|
}
|
|
@@ -84,11 +89,6 @@ class GraphRouter {
|
|
|
84
89
|
this.removeNodeFromPreviouslyCreatedEdge(startNodeCreated);
|
|
85
90
|
}
|
|
86
91
|
|
|
87
|
-
let route;
|
|
88
|
-
if (path && path.length !== 0) {
|
|
89
|
-
route = Itinerary.fromNetworkNodes(path, _start, _end);
|
|
90
|
-
}
|
|
91
|
-
|
|
92
92
|
return route;
|
|
93
93
|
}
|
|
94
94
|
|
|
@@ -145,7 +145,7 @@ class GraphRouter {
|
|
|
145
145
|
vertexNodes = {},
|
|
146
146
|
parentVertices = {},
|
|
147
147
|
path = [];
|
|
148
|
-
let vertexId =
|
|
148
|
+
let vertexId = 1;
|
|
149
149
|
|
|
150
150
|
// Initially, we assume each vertex is unreachable
|
|
151
151
|
this.network.nodes.forEach(vertex => {
|
package/src/graph/Network.js
CHANGED
|
@@ -22,6 +22,37 @@ class Network {
|
|
|
22
22
|
|| node2 === edge.node1 && node1 === edge.node2
|
|
23
23
|
);
|
|
24
24
|
}
|
|
25
|
+
|
|
26
|
+
toString(_nodeToStringFn, _edgeToStringFn) {
|
|
27
|
+
|
|
28
|
+
let nodeToStringFn = _nodeToStringFn;
|
|
29
|
+
if (!nodeToStringFn) {
|
|
30
|
+
nodeToStringFn = node => `${node.data.name}`;
|
|
31
|
+
}
|
|
32
|
+
|
|
33
|
+
let edgeToStringFn = _edgeToStringFn;
|
|
34
|
+
if (!_edgeToStringFn) {
|
|
35
|
+
edgeToStringFn = edge => `${edge.data.name}`;
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
let output
|
|
39
|
+
= '--- Network ---\n'
|
|
40
|
+
+ `Nodes: ${this.nodes.length}\n`
|
|
41
|
+
+ `Edges: ${this.edges.length}\n`
|
|
42
|
+
+ '---\n'
|
|
43
|
+
+ 'Nodes\n';
|
|
44
|
+
this.nodes.forEach(node => {
|
|
45
|
+
output += `${nodeToStringFn(node)} [edges: ${node.edges.length}]\n`;
|
|
46
|
+
});
|
|
47
|
+
output += '---\n'
|
|
48
|
+
+ 'Edges\n';
|
|
49
|
+
this.edges.forEach(edge => {
|
|
50
|
+
output += `${edgeToStringFn(edge)} `;
|
|
51
|
+
output += `[${nodeToStringFn(edge.node1)} -- ${nodeToStringFn(edge.node2)}]\n`;
|
|
52
|
+
});
|
|
53
|
+
output += '---';
|
|
54
|
+
return output;
|
|
55
|
+
}
|
|
25
56
|
}
|
|
26
57
|
|
|
27
58
|
export default Network;
|