Dataset Viewer
index
stringlengths 1
4
| input_prompt
stringlengths 489
1.07k
| answer
stringclasses 24
values | node_range
stringclasses 5
values | edge_range
stringclasses 5
values |
|---|---|---|---|---|
0
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 8] [1, 5] [2, 3] [3, 6] [4, 3], and the edges are: (0, 4) (0, 3) (0, 1) (1, 3) (1, 2) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 19
|
[2, 5]
|
[0, 6]
|
2
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 3, weights of nodes are: [0, 5] [1, 2] [2, 5] [3, 9], and the edges are: (1, 2) (1, 3) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 16
|
[2, 5]
|
[0, 6]
|
4
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 2] [1, 9] [2, 9] [3, 4] [4, 2], and the edges are: (1, 3) (2, 4) (2, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 15
|
[2, 5]
|
[0, 6]
|
6
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 9] [1, 7] [2, 1] [3, 7] [4, 7], and the edges are: (0, 1) (0, 3) (0, 4) (1, 4). What is the maximum sum of the weights of three nodes?
|
### 23
|
[2, 5]
|
[0, 6]
|
8
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 10] [1, 1] [2, 5] [3, 4] [4, 3], and the edges are: (0, 4) (0, 3) (1, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 17
|
[2, 5]
|
[0, 6]
|
10
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 6] [1, 8] [2, 4] [3, 9] [4, 1], and the edges are: (0, 2) (0, 3) (0, 4) (1, 3) (2, 4) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 16
|
[2, 5]
|
[0, 6]
|
12
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 9] [1, 10] [2, 5] [3, 3] [4, 8], and the edges are: (0, 2) (0, 4) (0, 1) (0, 3) (2, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 22
|
[2, 5]
|
[0, 6]
|
14
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 2] [1, 7] [2, 2] [3, 3] [4, 2], and the edges are: (0, 3) (0, 1) (0, 4) (1, 4). What is the maximum sum of the weights of three nodes?
|
### 11
|
[2, 5]
|
[0, 6]
|
16
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 1] [1, 7] [2, 6] [3, 3] [4, 10], and the edges are: (1, 2) (1, 4) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 23
|
[2, 5]
|
[0, 6]
|
18
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 8] [1, 1] [2, 1] [3, 3] [4, 4], and the edges are: (0, 2) (1, 3) (1, 2) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 5
|
[2, 5]
|
[0, 6]
|
20
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 9] [1, 9] [2, 7] [3, 7] [4, 2], and the edges are: (0, 3) (1, 3) (1, 2) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 23
|
[2, 5]
|
[0, 6]
|
22
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 5] [1, 4] [2, 3] [3, 7] [4, 10], and the edges are: (0, 4) (1, 4) (1, 3) (1, 2) (2, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 21
|
[2, 5]
|
[0, 6]
|
24
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 2] [1, 5] [2, 1] [3, 6] [4, 8], and the edges are: (0, 3) (0, 2) (0, 4) (1, 2) (2, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 16
|
[2, 5]
|
[0, 6]
|
26
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 7] [1, 8] [2, 8] [3, 10] [4, 5], and the edges are: (0, 4) (0, 2) (1, 4) (2, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 20
|
[2, 5]
|
[0, 6]
|
28
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 9] [1, 4] [2, 1] [3, 6] [4, 1], and the edges are: (0, 3) (0, 1) (1, 3). What is the maximum sum of the weights of three nodes?
|
### 19
|
[2, 5]
|
[0, 6]
|
30
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 8] [1, 5] [2, 6] [3, 7] [4, 9], and the edges are: (0, 3) (0, 2) (0, 1) (1, 3) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 20
|
[2, 5]
|
[0, 6]
|
32
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 1] [1, 3] [2, 5] [3, 1] [4, 6], and the edges are: (0, 1) (0, 2) (1, 2) (1, 4) (1, 3) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 14
|
[2, 5]
|
[0, 6]
|
34
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 10] [1, 4] [2, 4] [3, 1] [4, 1], and the edges are: (0, 2) (0, 4) (0, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 12
|
[2, 5]
|
[0, 6]
|
36
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 5] [1, 8] [2, 8] [3, 6] [4, 1], and the edges are: (0, 2) (0, 4) (0, 1) (2, 4) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 14
|
[2, 5]
|
[0, 6]
|
38
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 4] [1, 3] [2, 9] [3, 6] [4, 10], and the edges are: (0, 4) (1, 4) (2, 3) (2, 4) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 25
|
[2, 5]
|
[0, 6]
|
40
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 10] [1, 1] [2, 6] [3, 3] [4, 8], and the edges are: (0, 1) (0, 2) (0, 3) (1, 2) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 17
|
[2, 5]
|
[0, 6]
|
42
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 10] [1, 6] [2, 4] [3, 1] [4, 9], and the edges are: (0, 2) (0, 1) (1, 4) (1, 3) (1, 2). What is the maximum sum of the weights of three nodes?
|
### 20
|
[2, 5]
|
[0, 6]
|
44
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 5] [1, 3] [2, 6] [3, 7] [4, 4], and the edges are: (0, 3) (1, 4) (2, 3) (2, 4) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 17
|
[2, 5]
|
[0, 6]
|
46
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 10] [1, 3] [2, 9] [3, 1] [4, 10], and the edges are: (0, 2) (1, 3) (1, 4) (1, 2) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 22
|
[2, 5]
|
[0, 6]
|
48
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 7] [1, 9] [2, 3] [3, 1] [4, 5], and the edges are: (0, 3) (1, 2) (1, 3) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 13
|
[2, 5]
|
[0, 6]
|
50
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 9] [1, 10] [2, 10] [3, 2] [4, 9], and the edges are: (0, 2) (0, 1) (0, 4) (1, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 28
|
[2, 5]
|
[0, 6]
|
52
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 1] [1, 3] [2, 8] [3, 5] [4, 7], and the edges are: (0, 3) (0, 4) (2, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 13
|
[2, 5]
|
[0, 6]
|
54
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 2] [1, 10] [2, 4] [3, 3] [4, 1], and the edges are: (0, 1) (0, 3) (0, 4) (1, 3) (1, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 15
|
[2, 5]
|
[0, 6]
|
56
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 10] [1, 3] [2, 3] [3, 4] [4, 6], and the edges are: (0, 3) (0, 2) (1, 4) (1, 2) (2, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 17
|
[2, 5]
|
[0, 6]
|
58
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 8] [1, 5] [2, 8] [3, 9] [4, 9], and the edges are: (0, 1) (0, 2) (0, 3) (2, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 25
|
[2, 5]
|
[0, 6]
|
60
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 3, weights of nodes are: [0, 8] [1, 7] [2, 2] [3, 7], and the edges are: (0, 1) (0, 2) (1, 2). What is the maximum sum of the weights of three nodes?
|
### 17
|
[2, 5]
|
[0, 6]
|
62
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 3, weights of nodes are: [0, 8] [1, 7] [2, 10] [3, 8], and the edges are: (0, 1) (0, 3) (1, 3). What is the maximum sum of the weights of three nodes?
|
### 23
|
[2, 5]
|
[0, 6]
|
64
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 1] [1, 3] [2, 2] [3, 5] [4, 3], and the edges are: (0, 1) (0, 4) (1, 4). What is the maximum sum of the weights of three nodes?
|
### 7
|
[2, 5]
|
[0, 6]
|
66
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 4] [1, 5] [2, 6] [3, 2] [4, 6], and the edges are: (0, 4) (0, 2) (1, 4) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 16
|
[2, 5]
|
[0, 6]
|
68
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 4] [1, 3] [2, 2] [3, 4] [4, 4], and the edges are: (0, 1) (0, 3) (0, 2) (1, 2) (1, 3). What is the maximum sum of the weights of three nodes?
|
### 11
|
[2, 5]
|
[0, 6]
|
70
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 6] [1, 7] [2, 1] [3, 6] [4, 2], and the edges are: (0, 2) (0, 1) (0, 4) (1, 2) (1, 3). What is the maximum sum of the weights of three nodes?
|
### 14
|
[2, 5]
|
[0, 6]
|
72
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 1] [1, 5] [2, 3] [3, 2] [4, 6], and the edges are: (0, 4) (1, 2) (1, 3) (1, 4) (2, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 14
|
[2, 5]
|
[0, 6]
|
74
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 3, weights of nodes are: [0, 4] [1, 1] [2, 3] [3, 5], and the edges are: (1, 3) (1, 2) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 9
|
[2, 5]
|
[0, 6]
|
76
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 3, weights of nodes are: [0, 8] [1, 1] [2, 9] [3, 7], and the edges are: (0, 2) (0, 1) (1, 2). What is the maximum sum of the weights of three nodes?
|
### 18
|
[2, 5]
|
[0, 6]
|
78
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 3, weights of nodes are: [0, 9] [1, 1] [2, 1] [3, 9], and the edges are: (1, 2) (1, 3) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 11
|
[2, 5]
|
[0, 6]
|
80
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 8] [1, 7] [2, 6] [3, 7] [4, 5], and the edges are: (0, 1) (0, 2) (1, 2) (1, 3). What is the maximum sum of the weights of three nodes?
|
### 21
|
[2, 5]
|
[0, 6]
|
82
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 3, weights of nodes are: [0, 7] [1, 10] [2, 2] [3, 8], and the edges are: (1, 3) (1, 2) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 20
|
[2, 5]
|
[0, 6]
|
84
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 3, weights of nodes are: [0, 1] [1, 3] [2, 10] [3, 6], and the edges are: (1, 3) (1, 2) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 19
|
[2, 5]
|
[0, 6]
|
86
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 7] [1, 7] [2, 2] [3, 6] [4, 9], and the edges are: (0, 3) (0, 1) (0, 2) (1, 3) (1, 2) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 20
|
[2, 5]
|
[0, 6]
|
88
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 3, weights of nodes are: [0, 10] [1, 5] [2, 7] [3, 1], and the edges are: (1, 2) (1, 3) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 13
|
[2, 5]
|
[0, 6]
|
90
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 4] [1, 5] [2, 3] [3, 8] [4, 4], and the edges are: (0, 4) (0, 2) (0, 3) (1, 3) (2, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 15
|
[2, 5]
|
[0, 6]
|
92
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 5] [1, 3] [2, 4] [3, 1] [4, 10], and the edges are: (0, 1) (0, 2) (0, 3) (1, 4) (2, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 10
|
[2, 5]
|
[0, 6]
|
94
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 3] [1, 2] [2, 4] [3, 6] [4, 9], and the edges are: (1, 4) (1, 3) (1, 2) (2, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 15
|
[2, 5]
|
[0, 6]
|
96
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 5] [1, 6] [2, 3] [3, 8] [4, 7], and the edges are: (0, 1) (1, 4) (1, 2) (2, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 16
|
[2, 5]
|
[0, 6]
|
98
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 1] [1, 2] [2, 1] [3, 5] [4, 9], and the edges are: (0, 2) (0, 1) (0, 3) (1, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 7
|
[2, 5]
|
[0, 6]
|
100
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 9] [1, 10] [2, 2] [3, 8] [4, 2], and the edges are: (0, 4) (0, 2) (1, 2) (1, 3) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 20
|
[2, 5]
|
[0, 6]
|
102
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 6] [1, 3] [2, 10] [3, 2] [4, 9], and the edges are: (0, 3) (0, 4) (1, 2) (1, 3) (2, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 17
|
[2, 5]
|
[0, 6]
|
104
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 10] [1, 1] [2, 4] [3, 9] [4, 2], and the edges are: (0, 3) (0, 4) (1, 3) (1, 2) (2, 3) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 14
|
[2, 5]
|
[0, 6]
|
106
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 9] [1, 3] [2, 2] [3, 9] [4, 3], and the edges are: (0, 4) (0, 2) (1, 2) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 14
|
[2, 5]
|
[0, 6]
|
108
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 6] [1, 10] [2, 7] [3, 1] [4, 5], and the edges are: (0, 3) (0, 4) (1, 2) (2, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 12
|
[2, 5]
|
[0, 6]
|
110
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 10] [1, 7] [2, 10] [3, 10] [4, 2], and the edges are: (0, 2) (1, 3) (1, 4) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 19
|
[2, 5]
|
[0, 6]
|
112
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 3] [1, 6] [2, 8] [3, 8] [4, 2], and the edges are: (0, 3) (0, 2) (0, 4) (1, 2) (1, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 13
|
[2, 5]
|
[0, 6]
|
114
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 3] [1, 8] [2, 10] [3, 6] [4, 8], and the edges are: (0, 2) (0, 4) (1, 4) (1, 2) (2, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 26
|
[2, 5]
|
[0, 6]
|
116
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 1] [1, 7] [2, 3] [3, 4] [4, 5], and the edges are: (0, 4) (0, 2) (0, 3) (1, 2) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 9
|
[2, 5]
|
[0, 6]
|
118
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 9] [1, 8] [2, 6] [3, 3] [4, 6], and the edges are: (0, 2) (0, 1) (1, 2) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 23
|
[2, 5]
|
[0, 6]
|
120
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 7] [1, 2] [2, 6] [3, 4] [4, 6], and the edges are: (1, 4) (1, 3) (2, 4) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 12
|
[2, 5]
|
[0, 6]
|
122
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 7] [1, 4] [2, 2] [3, 6] [4, 1], and the edges are: (0, 1) (0, 3) (0, 2) (1, 4) (2, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 15
|
[2, 5]
|
[0, 6]
|
124
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 3, weights of nodes are: [0, 8] [1, 8] [2, 5] [3, 9], and the edges are: (0, 3) (0, 2) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 22
|
[2, 5]
|
[0, 6]
|
126
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 5] [1, 6] [2, 5] [3, 10] [4, 10], and the edges are: (0, 1) (0, 2) (1, 2) (2, 4) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 16
|
[2, 5]
|
[0, 6]
|
128
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 10] [1, 6] [2, 1] [3, 9] [4, 6], and the edges are: (0, 3) (0, 1) (0, 2) (1, 3) (1, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 25
|
[2, 5]
|
[0, 6]
|
130
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 4] [1, 4] [2, 4] [3, 9] [4, 1], and the edges are: (0, 4) (1, 2) (1, 4) (2, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 9
|
[2, 5]
|
[0, 6]
|
132
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 5] [1, 1] [2, 7] [3, 1] [4, 5], and the edges are: (0, 3) (0, 2) (0, 4) (2, 4) (2, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 17
|
[2, 5]
|
[0, 6]
|
134
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 10] [1, 7] [2, 4] [3, 10] [4, 10], and the edges are: (1, 3) (1, 2) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 21
|
[2, 5]
|
[0, 6]
|
136
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 5] [1, 2] [2, 10] [3, 6] [4, 2], and the edges are: (0, 1) (0, 4) (1, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 9
|
[2, 5]
|
[0, 6]
|
138
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 3, weights of nodes are: [0, 6] [1, 2] [2, 9] [3, 9], and the edges are: (0, 1) (0, 3) (1, 3). What is the maximum sum of the weights of three nodes?
|
### 17
|
[2, 5]
|
[0, 6]
|
140
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 5] [1, 4] [2, 3] [3, 1] [4, 9], and the edges are: (0, 1) (0, 4) (1, 4) (2, 3) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 18
|
[2, 5]
|
[0, 6]
|
142
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 3] [1, 9] [2, 7] [3, 2] [4, 4], and the edges are: (0, 3) (0, 4) (0, 2) (2, 4) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 14
|
[2, 5]
|
[0, 6]
|
144
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 4] [1, 7] [2, 1] [3, 9] [4, 7], and the edges are: (0, 3) (1, 4) (1, 3) (2, 4) (2, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 23
|
[2, 5]
|
[0, 6]
|
146
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 6] [1, 7] [2, 5] [3, 7] [4, 8], and the edges are: (0, 2) (0, 1) (1, 2) (2, 4) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 18
|
[2, 5]
|
[0, 6]
|
148
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 3] [1, 10] [2, 3] [3, 9] [4, 2], and the edges are: (0, 1) (0, 4) (1, 4) (2, 4) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 15
|
[2, 5]
|
[0, 6]
|
150
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 5] [1, 2] [2, 1] [3, 8] [4, 5], and the edges are: (0, 4) (0, 1) (0, 3) (1, 4) (1, 2) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 12
|
[2, 5]
|
[0, 6]
|
152
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 4] [1, 1] [2, 3] [3, 6] [4, 7], and the edges are: (0, 3) (0, 1) (0, 4) (1, 4) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 12
|
[2, 5]
|
[0, 6]
|
154
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 5] [1, 3] [2, 8] [3, 3] [4, 4], and the edges are: (0, 2) (0, 1) (1, 2) (1, 3) (3, 4). What is the maximum sum of the weights of three nodes?
|
### 16
|
[2, 5]
|
[0, 6]
|
156
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 7] [1, 1] [2, 8] [3, 3] [4, 9], and the edges are: (0, 4) (0, 2) (0, 1) (1, 3) (1, 4) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 24
|
[2, 5]
|
[0, 6]
|
158
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 4, weights of nodes are: [0, 3] [1, 4] [2, 5] [3, 2] [4, 4], and the edges are: (0, 1) (0, 3) (0, 2) (2, 3). What is the maximum sum of the weights of three nodes?
|
### 10
|
[2, 5]
|
[0, 6]
|
400
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 6, weights of nodes are: [0, 8] [1, 6] [2, 9] [3, 6] [4, 8] [5, 7] [6, 8], and the edges are: (1, 6) (1, 5) (2, 4) (5, 6). What is the maximum sum of the weights of three nodes?
|
### 21
|
[5, 10]
|
[0, 9]
|
402
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 1] [1, 7] [2, 8] [3, 4] [4, 3] [5, 4] [6, 9] [7, 7] [8, 9] [9, 3], and the edges are: (1, 2) (1, 3) (1, 8) (2, 8) (4, 6) (8, 9). What is the maximum sum of the weights of three nodes?
|
### 24
|
[5, 10]
|
[0, 9]
|
404
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 7] [1, 3] [2, 8] [3, 6] [4, 7] [5, 3] [6, 1] [7, 5] [8, 5] [9, 4], and the edges are: (0, 4) (1, 5) (1, 6) (2, 8) (2, 6) (4, 6) (5, 7) (6, 8) (8, 9). What is the maximum sum of the weights of three nodes?
|
### 14
|
[5, 10]
|
[0, 9]
|
406
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 8, weights of nodes are: [0, 10] [1, 8] [2, 3] [3, 6] [4, 10] [5, 10] [6, 9] [7, 9] [8, 3], and the edges are: (0, 7) (0, 2) (2, 5) (2, 7) (2, 6) (3, 7). What is the maximum sum of the weights of three nodes?
|
### 22
|
[5, 10]
|
[0, 9]
|
408
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 6] [1, 6] [2, 1] [3, 3] [4, 6] [5, 1] [6, 6] [7, 9] [8, 4] [9, 2], and the edges are: (0, 8) (1, 6) (1, 4) (1, 9) (4, 6) (6, 9) (7, 8). What is the maximum sum of the weights of three nodes?
|
### 18
|
[5, 10]
|
[0, 9]
|
410
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 7, weights of nodes are: [0, 5] [1, 2] [2, 2] [3, 8] [4, 1] [5, 10] [6, 2] [7, 6], and the edges are: (2, 6) (2, 7) (6, 7). What is the maximum sum of the weights of three nodes?
|
### 10
|
[5, 10]
|
[0, 9]
|
412
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 8] [1, 2] [2, 4] [3, 3] [4, 7] [5, 1] [6, 1] [7, 8] [8, 3] [9, 1], and the edges are: (0, 5) (1, 2) (1, 9) (2, 9) (4, 5) (4, 7) (5, 8) (5, 9) (7, 8). What is the maximum sum of the weights of three nodes?
|
### 7
|
[5, 10]
|
[0, 9]
|
414
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 8, weights of nodes are: [0, 1] [1, 10] [2, 9] [3, 7] [4, 9] [5, 4] [6, 9] [7, 6] [8, 5], and the edges are: (0, 4) (1, 3) (2, 8) (3, 4) (5, 6) (5, 8) (6, 8). What is the maximum sum of the weights of three nodes?
|
### 18
|
[5, 10]
|
[0, 9]
|
416
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 6] [1, 2] [2, 7] [3, 4] [4, 10] [5, 8] [6, 8] [7, 8] [8, 1] [9, 5], and the edges are: (0, 8) (0, 6) (1, 4) (2, 9) (2, 4) (2, 8) (4, 8) (7, 8). What is the maximum sum of the weights of three nodes?
|
### 18
|
[5, 10]
|
[0, 9]
|
418
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 1] [1, 4] [2, 8] [3, 3] [4, 7] [5, 9] [6, 4] [7, 5] [8, 6] [9, 7], and the edges are: (0, 6) (2, 9) (2, 7) (5, 6) (5, 9) (6, 9). What is the maximum sum of the weights of three nodes?
|
### 20
|
[5, 10]
|
[0, 9]
|
420
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 1] [1, 4] [2, 10] [3, 5] [4, 1] [5, 9] [6, 4] [7, 4] [8, 4] [9, 3], and the edges are: (1, 4) (2, 4) (3, 6) (3, 4) (4, 8) (4, 6) (7, 9) (8, 9). What is the maximum sum of the weights of three nodes?
|
### 10
|
[5, 10]
|
[0, 9]
|
422
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 2] [1, 3] [2, 2] [3, 8] [4, 7] [5, 9] [6, 1] [7, 1] [8, 7] [9, 6], and the edges are: (0, 7) (0, 9) (0, 2) (0, 8) (0, 5) (2, 9) (2, 3) (4, 6) (7, 9). What is the maximum sum of the weights of three nodes?
|
### 10
|
[5, 10]
|
[0, 9]
|
424
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 7, weights of nodes are: [0, 4] [1, 10] [2, 5] [3, 7] [4, 6] [5, 8] [6, 5] [7, 3], and the edges are: (1, 2) (1, 6) (2, 6) (4, 6) (5, 7). What is the maximum sum of the weights of three nodes?
|
### 20
|
[5, 10]
|
[0, 9]
|
426
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 5] [1, 1] [2, 3] [3, 6] [4, 8] [5, 10] [6, 9] [7, 1] [8, 4] [9, 2], and the edges are: (0, 2) (0, 4) (0, 8) (1, 8) (2, 4) (2, 3) (2, 7). What is the maximum sum of the weights of three nodes?
|
### 16
|
[5, 10]
|
[0, 9]
|
428
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 3] [1, 5] [2, 7] [3, 6] [4, 3] [5, 5] [6, 9] [7, 4] [8, 4] [9, 4], and the edges are: (2, 6) (2, 8) (3, 7) (3, 9) (5, 8) (5, 9) (5, 7) (8, 9). What is the maximum sum of the weights of three nodes?
|
### 13
|
[5, 10]
|
[0, 9]
|
430
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 8, weights of nodes are: [0, 9] [1, 7] [2, 2] [3, 8] [4, 5] [5, 1] [6, 3] [7, 9] [8, 1], and the edges are: (0, 4) (0, 1) (1, 4) (2, 8) (3, 5). What is the maximum sum of the weights of three nodes?
|
### 21
|
[5, 10]
|
[0, 9]
|
432
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 9] [1, 5] [2, 5] [3, 8] [4, 8] [5, 5] [6, 10] [7, 10] [8, 2] [9, 5], and the edges are: (0, 1) (1, 3) (1, 4) (1, 7) (1, 6) (2, 6) (4, 7) (4, 5). What is the maximum sum of the weights of three nodes?
|
### 23
|
[5, 10]
|
[0, 9]
|
434
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 7, weights of nodes are: [0, 4] [1, 9] [2, 7] [3, 3] [4, 2] [5, 1] [6, 3] [7, 2], and the edges are: (0, 3) (0, 2) (2, 3) (3, 6). What is the maximum sum of the weights of three nodes?
|
### 14
|
[5, 10]
|
[0, 9]
|
436
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 6, weights of nodes are: [0, 2] [1, 10] [2, 10] [3, 6] [4, 1] [5, 8] [6, 2], and the edges are: (1, 6) (1, 4) (1, 2) (2, 4). What is the maximum sum of the weights of three nodes?
|
### 21
|
[5, 10]
|
[0, 9]
|
438
|
Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 8, weights of nodes are: [0, 6] [1, 7] [2, 10] [3, 8] [4, 3] [5, 2] [6, 7] [7, 10] [8, 2], and the edges are: (0, 2) (1, 7) (1, 5) (4, 7) (5, 7) (7, 8). What is the maximum sum of the weights of three nodes?
|
### 19
|
[5, 10]
|
[0, 9]
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 8