-
Notifications
You must be signed in to change notification settings - Fork 0
/
server.js
221 lines (191 loc) · 7.25 KB
/
server.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
/*
* @Author: Kitiro
* @Date: 2019-11-12 18:16:45
* @Last Modified by: Kitiro
* @Last Modified time: 2019-11-12 23:27:20
*/
//模块调用
var qs = require('querystring');
var http = require("http");
var fs = require('fs');
var url = require('url');
var util = require('util');
var express = require('express');
var path = require('path');
var bodyParser = require('body-parser');
var app = express();
var readline = require('readline');
//数据库设置
var neo4j = require('neo4j-driver');
var uri = "bolt://localhost:7687";
var user = "neo4j";
var password = "neo4j";
const driver = neo4j.driver(uri, neo4j.auth.basic(user, password));
const session = driver.session();
var flag = 1;
//cypher查询语句
all_relation = "MATCH p = ()-[r]->() RETURN p"
count_node = "MATCH (c:Character) RETURN count(c)"
centrality = "MATCH p = (c:Character)-[r:INTERACTS]-() RETURN c.name AS character, count(*) AS degree, sum(r.weight) AS weightedDegree ORDER BY weightedDegree DESC LIMIT 10"
shortest_path = "MATCH path=shortestPath((start:Character {name:$start})-[INTERACTS*]-(end:Character {name:$end})) RETURN path"
// MATCH (catelyn:Character {name: "Catelyn"}), (drogo:Character {name: "Drogo"})
// MATCH p=shortestPath((catelyn)-[INTERACTS*]-(drogo))
// RETURN p
app.use(express.static(path.join(__dirname, '')));
app.use(bodyParser());
app.post('/ppp',function(req,res){
var now = new Date();
console.log('Now:'+ now);
console.log('a new request '+ JSON.stringify(req.body));
console.log('from'+ req.connection.remoteAddress);
console.log('--------------------------------------');
//输出图的基本信息
var option = parseInt(req.body.option)
if(option == 0 || option == 2){
var count = 0;
var data={
'map':[],
};
var resultPromise = session
.run(
all_relation,
)
.subscribe({
onNext:function(response){
if(response){
path = response['_fields'][0].segments[0]
name1 = path['start'].properties.name
relationship = path['relationship'].properties.weight.low
console.log(path['end'])
name2 = path['end'].properties.name
data['map'][count] = {
'c1':name1,
'relationship':relationship,
'c2':name2,
}
count++;
}
},
onCompleted: function () {
data['pathNum'] = count;
console.log(count + ' path found');
console.log('search succeed');
res.send(JSON.stringify(data));
count = 0;
res.end();
// session.close();
},
onError: function (error) {
console.log(error);
}
})
}
else if(option == 1){ //中心度
var count = 0;
var data=[];
var resultPromise = session
.run(
centrality,
)
.subscribe({
onNext:function(response){
if(response){
//console.log(response);
name = response['_fields'][0]
degree = response['_fields'][1].low
weightedDegree = response['_fields'][2].low
data[count] = {
'name':name,
'degree':degree,
'weightedDegree':weightedDegree,
}
count++;
}
},
onCompleted: function () {
res.send(JSON.stringify(data));
count = 0;
res.end();
// session.close();
},
onError: function (error) {
console.log(error);
}
})
}
//最短路径
else if(option == 3){
var data={
'path':[]
};
var name1 = req.body.info1;
var name2 = req.body.info2;
var resultPromise = session
.run(
shortest_path,{start:name1, end:name2}
)
.subscribe({
onNext:function(response){
if(response){
paths = response['_fields'][0].segments;
length = response['_fields'][0].length;
data['length'] = length;
data['path'][0] = name1;
for(var i = 0; i < length; i++){
data['path'][i+1] = paths[i].end.properties.name;
}
}
},
onCompleted: function () {
console.log('shortest path :',length,'. from',name1,'to',name2);
console.log('search succeed');
res.send(data);
res.end();
// session.close();
},
onError: function (error) {
console.log(error);
}
})
}
//查找最短路径
else if(option == 4){
var personName = req.body.info1;
var personName2 = req.body.info2;
var pathCount = 0;
var resultPromise = session
.run(
'Match (n:Person {person: $name}), (m:Person {person: $name2}), p =allShortestPaths((n)-[r*1..20]-(m)) with reduce(weight = 0, rel in rels(p) | weight + rel.weight) AS weight, n, m,p return relationships(p),length(p),nodes(p) order by weight desc limit 10',
{name: personName,name2:personName2}
)
.subscribe({
onNext:function(record){
var length = parseInt(record.get(1));
save['pathLength'] = length;
save['path'+ pathCount + '-' + 0] = record.get(2)[0].properties.person;
console.log(record.get(0));
console.log(record.get(1));
console.log(record.get(2));
for(var i = 1; i <= length ;i++){
save['path'+ pathCount + '-' + i] = record.get(2)[i].properties.person;
save['path'+ pathCount + '-' + i + 'weight'] = parseInt(record.get(0)[i-1].properties.weight);
}
pathCount++;
},
onCompleted: function () {
save['pathNum'] = pathCount;
console.log(data);
res.send(data);
count = 0;
res.end();
// session.close();
},
onError: function (error) {
console.log(error);
}
})
}
})
app.listen(8888,function(){
console.log("server is running...");
})