質問編集履歴
1
プログラムの一部修正
test
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
トポロジカルソートを使って，最も
|
|
1
|
+
トポロジカルソートを使って，最も長くなるような経路を求める
|
test
CHANGED
|
@@ -4,8 +4,6 @@
|
|
|
4
4
|
|
|
5
5
|
```javascript
|
|
6
6
|
|
|
7
|
-
|
|
8
|
-
|
|
9
7
|
function init_graph(p) {
|
|
10
8
|
|
|
11
9
|
var adj = []
|
|
@@ -228,17 +226,17 @@
|
|
|
228
226
|
|
|
229
227
|
var n = adj.length
|
|
230
228
|
|
|
231
|
-
var val = []
|
|
229
|
+
//var val = []
|
|
232
230
|
|
|
233
231
|
var res = []
|
|
234
232
|
|
|
235
|
-
for (var i = 0; i < n; i++) val[i] = 0
|
|
233
|
+
//for (var i = 0; i < n; i++) val[i] = 0
|
|
236
234
|
|
|
237
235
|
function det(i) {
|
|
238
236
|
|
|
239
|
-
if (val[i] == 0) {
|
|
237
|
+
//if (val[i] == 0) {
|
|
240
|
-
|
|
238
|
+
|
|
241
|
-
val[i] = 1
|
|
239
|
+
//val[i] = 1
|
|
242
240
|
|
|
243
241
|
var lst = adj[i]
|
|
244
242
|
|
|
@@ -246,19 +244,17 @@
|
|
|
246
244
|
|
|
247
245
|
var k = lst[j]
|
|
248
246
|
|
|
247
|
+
if (i != B) det(k)
|
|
248
|
+
|
|
249
|
-
//
|
|
249
|
+
//det(k)
|
|
250
|
-
|
|
251
|
-
det(k)
|
|
252
250
|
|
|
253
251
|
}
|
|
254
252
|
|
|
255
253
|
res.unshift(i)
|
|
256
254
|
|
|
255
|
+
//}
|
|
256
|
+
|
|
257
|
-
|
|
257
|
+
}
|
|
258
|
-
|
|
259
|
-
}
|
|
260
|
-
|
|
261
|
-
//for (var i = 0; i < n; i++) det(i)
|
|
262
258
|
|
|
263
259
|
det(A)
|
|
264
260
|
|
|
@@ -276,7 +272,7 @@
|
|
|
276
272
|
|
|
277
273
|
puts(adj2)
|
|
278
274
|
|
|
279
|
-
puts(tsort(adj2,
|
|
275
|
+
puts(tsort(adj2,0,7))
|
|
280
276
|
|
|
281
277
|
```
|
|
282
278
|
|