index
stringlengths 1
4
| input_prompt
stringlengths 489
1.07k
| answer
stringclasses 24
values | node_range
stringclasses 5
values | edge_range
stringclasses 5
values |
|---|---|---|---|---|
440 | 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, 2] [2, 8] [3, 5] [4, 9] [5, 5] [6, 5] [7, 3] [8, 5] [9, 3], and the edges are: (1, 4) (1, 5) (2, 7) (4, 9) (7, 8) (7, 9) (8, 9). What is the maximum sum of the weights of three nodes? | ### 11 | [5, 10] | [0, 9] |
442 | 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, 7] [1, 3] [2, 7] [3, 3] [4, 10] [5, 5] [6, 9] [7, 2] [8, 8], and the edges are: (0, 6) (0, 5) (0, 7) (0, 2) (2, 3) (2, 5) (4, 5). What is the maximum sum of the weights of three nodes? | ### 19 | [5, 10] | [0, 9] |
444 | 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, 1] [2, 5] [3, 3] [4, 5] [5, 5] [6, 2] [7, 8] [8, 5], and the edges are: (0, 4) (1, 5) (2, 3) (2, 6) (2, 8) (3, 6). What is the maximum sum of the weights of three nodes? | ### 10 | [5, 10] | [0, 9] |
446 | 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, 8] [3, 6] [4, 6] [5, 7] [6, 2] [7, 4], and the edges are: (0, 7) (0, 5) (3, 4) (5, 7). What is the maximum sum of the weights of three nodes? | ### 15 | [5, 10] | [0, 9] |
448 | 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, 3] [1, 9] [2, 2] [3, 3] [4, 4] [5, 4] [6, 1] [7, 7] [8, 9], and the edges are: (0, 7) (0, 6) (1, 2) (2, 8) (2, 7) (2, 5) (5, 8). What is the maximum sum of the weights of three nodes? | ### 15 | [5, 10] | [0, 9] |
450 | 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, 10] [1, 5] [2, 8] [3, 2] [4, 8] [5, 5] [6, 5] [7, 7] [8, 10] [9, 4], and the edges are: (0, 9) (1, 9) (1, 4) (1, 2) (2, 9) (2, 5). What is the maximum sum of the weights of three nodes? | ### 17 | [5, 10] | [0, 9] |
452 | 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, 4] [2, 3] [3, 8] [4, 1] [5, 9] [6, 9] [7, 1] [8, 1] [9, 2], and the edges are: (0, 4) (0, 2) (0, 7) (2, 7) (3, 7) (3, 9) (4, 9) (5, 8). What is the maximum sum of the weights of three nodes? | ### 9 | [5, 10] | [0, 9] |
454 | 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, 6] [1, 8] [2, 3] [3, 4] [4, 4] [5, 1] [6, 5] [7, 4], and the edges are: (0, 2) (2, 4) (2, 6) (4, 6) (4, 5). What is the maximum sum of the weights of three nodes? | ### 12 | [5, 10] | [0, 9] |
456 | 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, 10] [2, 8] [3, 8] [4, 8] [5, 5] [6, 4] [7, 9] [8, 1] [9, 10], and the edges are: (0, 2) (0, 9) (1, 4) (1, 6) (2, 9) (3, 7) (7, 8) (8, 9). What is the maximum sum of the weights of three nodes? | ### 19 | [5, 10] | [0, 9] |
458 | 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, 4] [2, 6] [3, 4] [4, 9] [5, 3] [6, 2] [7, 5] [8, 9] [9, 10], and the edges are: (0, 9) (1, 6) (3, 8) (4, 5) (4, 9) (5, 9) (6, 9). What is the maximum sum of the weights of three nodes? | ### 22 | [5, 10] | [0, 9] |
460 | 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, 1] [3, 9] [4, 3] [5, 3] [6, 1] [7, 9] [8, 9] [9, 2], and the edges are: (1, 8) (1, 4) (2, 7) (3, 4) (3, 9) (3, 7) (4, 6) (4, 7) (6, 9). What is the maximum sum of the weights of three nodes? | ### 21 | [5, 10] | [0, 9] |
462 | 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, 2] [1, 4] [2, 8] [3, 10] [4, 1] [5, 1] [6, 9] [7, 7] [8, 2], and the edges are: (0, 4) (1, 6) (1, 5) (1, 2) (2, 4) (2, 6) (3, 4). What is the maximum sum of the weights of three nodes? | ### 21 | [5, 10] | [0, 9] |
464 | 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, 3] [2, 7] [3, 5] [4, 1] [5, 7] [6, 4] [7, 9] [8, 4] [9, 7], and the edges are: (0, 6) (0, 7) (0, 9) (1, 5) (1, 2) (1, 4) (1, 8) (2, 6) (5, 8). What is the maximum sum of the weights of three nodes? | ### 14 | [5, 10] | [0, 9] |
466 | 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, 8] [1, 6] [2, 7] [3, 1] [4, 10] [5, 9] [6, 8] [7, 1], and the edges are: (0, 7) (0, 2) (2, 7) (2, 5) (3, 5). What is the maximum sum of the weights of three nodes? | ### 16 | [5, 10] | [0, 9] |
468 | 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, 5] [1, 4] [2, 7] [3, 6] [4, 7] [5, 1] [6, 8] [7, 5] [8, 2], and the edges are: (0, 5) (1, 8) (1, 2) (2, 8) (2, 7) (4, 5) (6, 8). What is the maximum sum of the weights of three nodes? | ### 13 | [5, 10] | [0, 9] |
470 | 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, 2] [2, 3] [3, 10] [4, 8] [5, 5] [6, 7] [7, 6] [8, 4] [9, 9], and the edges are: (0, 9) (0, 5) (1, 6) (1, 2) (1, 7) (3, 8) (3, 5) (3, 7) (5, 7). What is the maximum sum of the weights of three nodes? | ### 21 | [5, 10] | [0, 9] |
472 | 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, 2] [2, 9] [3, 1] [4, 7] [5, 4] [6, 3] [7, 3] [8, 4], and the edges are: (0, 1) (0, 3) (1, 3) (3, 4) (5, 8) (7, 8). What is the maximum sum of the weights of three nodes? | ### 9 | [5, 10] | [0, 9] |
474 | 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, 10] [2, 5] [3, 2] [4, 5] [5, 7] [6, 5] [7, 3] [8, 7] [9, 5], and the edges are: (0, 4) (1, 8) (3, 5) (5, 7) (6, 8) (6, 9) (8, 9). What is the maximum sum of the weights of three nodes? | ### 17 | [5, 10] | [0, 9] |
476 | 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, 6] [2, 9] [3, 2] [4, 6] [5, 8] [6, 3] [7, 8] [8, 4], and the edges are: (0, 3) (0, 6) (0, 2) (1, 8) (1, 2) (2, 3) (5, 7). What is the maximum sum of the weights of three nodes? | ### 17 | [5, 10] | [0, 9] |
478 | 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, 5] [2, 6] [3, 3] [4, 1] [5, 5] [6, 9] [7, 9] [8, 2] [9, 2], and the edges are: (2, 8) (4, 9) (4, 5) (4, 8) (4, 7) (5, 7) (8, 9). What is the maximum sum of the weights of three nodes? | ### 15 | [5, 10] | [0, 9] |
480 | 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, 10] [1, 1] [2, 3] [3, 6] [4, 5] [5, 5] [6, 1] [7, 3], and the edges are: (0, 1) (0, 4) (1, 4) (1, 7) (3, 7). What is the maximum sum of the weights of three nodes? | ### 16 | [5, 10] | [0, 9] |
482 | 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, 2] [2, 8] [3, 1] [4, 6] [5, 1] [6, 6] [7, 4] [8, 7] [9, 5], and the edges are: (0, 7) (0, 2) (0, 4) (1, 7) (2, 7) (2, 6) (3, 4) (6, 7). What is the maximum sum of the weights of three nodes? | ### 18 | [5, 10] | [0, 9] |
484 | 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, 5] [4, 8] [5, 7] [6, 8] [7, 4] [8, 10] [9, 6], and the edges are: (0, 7) (0, 2) (0, 3) (2, 5) (3, 8) (3, 7) (5, 9) (7, 9). What is the maximum sum of the weights of three nodes? | ### 15 | [5, 10] | [0, 9] |
486 | 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, 9] [2, 9] [3, 1] [4, 6] [5, 10] [6, 4] [7, 8] [8, 10] [9, 7], and the edges are: (0, 1) (1, 8) (1, 5) (4, 8) (5, 8). What is the maximum sum of the weights of three nodes? | ### 29 | [5, 10] | [0, 9] |
488 | 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, 3] [1, 6] [2, 9] [3, 10] [4, 1] [5, 8] [6, 9] [7, 1] [8, 4], and the edges are: (0, 2) (0, 6) (1, 6) (2, 6) (3, 5) (4, 7) (6, 7). What is the maximum sum of the weights of three nodes? | ### 21 | [5, 10] | [0, 9] |
490 | 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, 10] [3, 10] [4, 5] [5, 5] [6, 6] [7, 3] [8, 1] [9, 7], and the edges are: (1, 7) (4, 6) (4, 7) (6, 7). What is the maximum sum of the weights of three nodes? | ### 14 | [5, 10] | [0, 9] |
492 | 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, 2] [2, 3] [3, 7] [4, 7] [5, 9] [6, 5] [7, 6] [8, 5] [9, 5], and the edges are: (1, 8) (1, 5) (2, 5) (2, 3) (3, 9) (4, 6) (5, 9) (5, 8) (6, 7). What is the maximum sum of the weights of three nodes? | ### 16 | [5, 10] | [0, 9] |
494 | 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, 7] [1, 9] [2, 7] [3, 10] [4, 2] [5, 6] [6, 6] [7, 1] [8, 6], and the edges are: (1, 4) (2, 5) (4, 8) (4, 7) (7, 8). What is the maximum sum of the weights of three nodes? | ### 9 | [5, 10] | [0, 9] |
496 | 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, 8] [2, 8] [3, 1] [4, 8] [5, 1] [6, 1] [7, 1] [8, 7] [9, 4], and the edges are: (2, 6) (2, 3) (2, 7) (3, 7) (5, 6). What is the maximum sum of the weights of three nodes? | ### 10 | [5, 10] | [0, 9] |
498 | 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, 2] [3, 3] [4, 9] [5, 5] [6, 5] [7, 10] [8, 4] [9, 10], and the edges are: (0, 8) (0, 3) (0, 7) (1, 7) (2, 7) (3, 6) (7, 8). What is the maximum sum of the weights of three nodes? | ### 15 | [5, 10] | [0, 9] |
500 | 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, 5] [1, 4] [2, 3] [3, 7] [4, 5] [5, 2] [6, 5] [7, 6] [8, 5], and the edges are: (1, 5) (2, 4) (4, 6) (4, 7) (6, 7). What is the maximum sum of the weights of three nodes? | ### 16 | [5, 10] | [0, 9] |
502 | 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, 4] [1, 6] [2, 3] [3, 3] [4, 5] [5, 5] [6, 1] [7, 9] [8, 8] [9, 7], and the edges are: (0, 4) (0, 7) (1, 6) (3, 4) (4, 8) (4, 5) (5, 8) (7, 8). What is the maximum sum of the weights of three nodes? | ### 18 | [5, 10] | [0, 9] |
504 | 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, 4] [2, 3] [3, 4] [4, 3] [5, 5] [6, 7] [7, 9], and the edges are: (0, 7) (0, 3) (2, 6) (3, 7) (6, 7). What is the maximum sum of the weights of three nodes? | ### 17 | [5, 10] | [0, 9] |
506 | 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, 3] [1, 6] [2, 1] [3, 4] [4, 9] [5, 1] [6, 10] [7, 1] [8, 10], and the edges are: (0, 6) (0, 8) (2, 6) (6, 8). What is the maximum sum of the weights of three nodes? | ### 23 | [5, 10] | [0, 9] |
508 | 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, 2] [1, 3] [2, 3] [3, 3] [4, 9] [5, 5] [6, 5] [7, 3], and the edges are: (0, 5) (0, 4) (0, 2) (2, 5) (3, 4). What is the maximum sum of the weights of three nodes? | ### 10 | [5, 10] | [0, 9] |
510 | 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, 4] [1, 8] [2, 6] [3, 7] [4, 1] [5, 3] [6, 9] [7, 9] [8, 8], and the edges are: (1, 7) (1, 5) (2, 7) (3, 4) (5, 8) (5, 7). What is the maximum sum of the weights of three nodes? | ### 20 | [5, 10] | [0, 9] |
512 | 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, 3] [2, 7] [3, 7] [4, 9] [5, 2] [6, 3] [7, 7] [8, 8] [9, 1], and the edges are: (0, 3) (0, 7) (3, 9) (3, 7) (4, 6) (5, 7) (8, 9). What is the maximum sum of the weights of three nodes? | ### 17 | [5, 10] | [0, 9] |
514 | 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, 8] [4, 6] [5, 6] [6, 8] [7, 3] [8, 8] [9, 6], and the edges are: (1, 7) (1, 2) (1, 3) (2, 4) (3, 5) (3, 7) (5, 8) (8, 9). What is the maximum sum of the weights of three nodes? | ### 12 | [5, 10] | [0, 9] |
516 | 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, 7] [1, 5] [2, 3] [3, 7] [4, 2] [5, 10] [6, 5] [7, 7] [8, 8], and the edges are: (0, 1) (0, 7) (0, 4) (1, 7) (2, 5) (3, 7). What is the maximum sum of the weights of three nodes? | ### 19 | [5, 10] | [0, 9] |
518 | 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, 7] [1, 9] [2, 3] [3, 1] [4, 8] [5, 8] [6, 2] [7, 6] [8, 8], and the edges are: (1, 5) (1, 4) (1, 2) (2, 5) (2, 7) (3, 8) (3, 6). What is the maximum sum of the weights of three nodes? | ### 20 | [5, 10] | [0, 9] |
520 | 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, 8] [2, 4] [3, 6] [4, 8] [5, 3] [6, 1] [7, 3] [8, 7], and the edges are: (2, 8) (2, 4) (2, 6) (3, 5) (3, 4) (4, 8) (5, 8). What is the maximum sum of the weights of three nodes? | ### 19 | [5, 10] | [0, 9] |
522 | 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, 3] [1, 10] [2, 6] [3, 9] [4, 10] [5, 3] [6, 6], and the edges are: (2, 4) (2, 5) (4, 5). What is the maximum sum of the weights of three nodes? | ### 19 | [5, 10] | [0, 9] |
524 | 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, 3] [2, 3] [3, 6] [4, 7] [5, 7] [6, 7] [7, 2] [8, 8] [9, 10], and the edges are: (0, 9) (1, 6) (1, 2) (3, 8) (4, 7) (5, 6) (5, 9) (5, 8) (6, 9). What is the maximum sum of the weights of three nodes? | ### 24 | [5, 10] | [0, 9] |
526 | 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, 1] [2, 10] [3, 2] [4, 1] [5, 6] [6, 9] [7, 3] [8, 3] [9, 9], and the edges are: (1, 9) (1, 8) (3, 6) (4, 6) (5, 9) (5, 6) (6, 9) (8, 9). What is the maximum sum of the weights of three nodes? | ### 24 | [5, 10] | [0, 9] |
528 | 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, 1] [1, 8] [2, 4] [3, 6] [4, 8] [5, 10] [6, 10] [7, 1], and the edges are: (1, 3) (1, 2) (4, 5) (4, 6) (5, 6). What is the maximum sum of the weights of three nodes? | ### 28 | [5, 10] | [0, 9] |
530 | 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, 8] [1, 1] [2, 4] [3, 2] [4, 3] [5, 2] [6, 4] [7, 1] [8, 5], and the edges are: (0, 3) (1, 6) (1, 2) (2, 6) (4, 8) (7, 8). What is the maximum sum of the weights of three nodes? | ### 9 | [5, 10] | [0, 9] |
532 | 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, 9] [2, 6] [3, 6] [4, 5] [5, 4] [6, 10] [7, 5] [8, 5] [9, 3], and the edges are: (0, 3) (0, 2) (2, 3) (3, 6) (3, 4) (4, 8) (5, 6). What is the maximum sum of the weights of three nodes? | ### 20 | [5, 10] | [0, 9] |
534 | 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, 8] [2, 2] [3, 8] [4, 7] [5, 2] [6, 8] [7, 8] [8, 7] [9, 8], and the edges are: (0, 8) (1, 5) (2, 9) (2, 7) (4, 8) (4, 6) (4, 7) (6, 8) (7, 8). What is the maximum sum of the weights of three nodes? | ### 22 | [5, 10] | [0, 9] |
536 | 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, 1] [2, 2] [3, 9] [4, 9] [5, 5] [6, 10] [7, 2] [8, 4], and the edges are: (0, 7) (1, 7) (1, 5) (1, 3) (2, 3) (3, 7) (4, 5). What is the maximum sum of the weights of three nodes? | ### 12 | [5, 10] | [0, 9] |
538 | 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, 4] [2, 6] [3, 8] [4, 6] [5, 4] [6, 4] [7, 5] [8, 1] [9, 8], and the edges are: (0, 5) (1, 9) (1, 7) (1, 2) (2, 7) (3, 6) (4, 6). What is the maximum sum of the weights of three nodes? | ### 15 | [5, 10] | [0, 9] |
540 | 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, 8] [1, 5] [2, 5] [3, 1] [4, 4] [5, 6] [6, 5] [7, 2] [8, 7], and the edges are: (0, 3) (0, 6) (0, 5) (1, 3) (2, 6) (3, 6). What is the maximum sum of the weights of three nodes? | ### 14 | [5, 10] | [0, 9] |
542 | 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, 6] [2, 7] [3, 2] [4, 5] [5, 8] [6, 10] [7, 6] [8, 7] [9, 7], and the edges are: (0, 7) (0, 9) (1, 9) (2, 7) (2, 6) (3, 6) (3, 9) (5, 7) (7, 9). What is the maximum sum of the weights of three nodes? | ### 16 | [5, 10] | [0, 9] |
544 | 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, 4] [2, 1] [3, 8] [4, 6] [5, 2] [6, 6] [7, 6] [8, 4] [9, 1], and the edges are: (0, 2) (0, 4) (1, 7) (2, 6) (3, 4) (3, 8) (4, 6) (4, 8) (5, 9). What is the maximum sum of the weights of three nodes? | ### 18 | [5, 10] | [0, 9] |
546 | 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, 1] [2, 4] [3, 9] [4, 5] [5, 5] [6, 6] [7, 7] [8, 2] [9, 9], and the edges are: (0, 3) (1, 5) (2, 4) (3, 9) (3, 6) (3, 5) (4, 5) (5, 9) (6, 9). What is the maximum sum of the weights of three nodes? | ### 24 | [5, 10] | [0, 9] |
548 | 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, 4] [1, 5] [2, 1] [3, 4] [4, 6] [5, 4] [6, 8] [7, 9] [8, 7], and the edges are: (1, 4) (1, 7) (1, 6) (4, 5) (5, 6) (6, 8) (6, 7). What is the maximum sum of the weights of three nodes? | ### 22 | [5, 10] | [0, 9] |
550 | 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, 5] [1, 7] [2, 7] [3, 7] [4, 10] [5, 5] [6, 1] [7, 8] [8, 10], and the edges are: (0, 3) (0, 5) (3, 5) (3, 8) (4, 8) (5, 6). What is the maximum sum of the weights of three nodes? | ### 17 | [5, 10] | [0, 9] |
552 | 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, 4] [2, 9] [3, 1] [4, 7] [5, 8] [6, 9] [7, 5] [8, 3], and the edges are: (0, 8) (2, 5) (3, 7) (4, 8) (4, 5) (5, 8). What is the maximum sum of the weights of three nodes? | ### 18 | [5, 10] | [0, 9] |
554 | 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, 9] [3, 5] [4, 5] [5, 1] [6, 9] [7, 1] [8, 1] [9, 4], and the edges are: (0, 2) (1, 4) (1, 3) (2, 5) (2, 8) (3, 9) (3, 4) (6, 9). What is the maximum sum of the weights of three nodes? | ### 15 | [5, 10] | [0, 9] |
556 | 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, 3] [2, 2] [3, 5] [4, 3] [5, 3] [6, 10] [7, 8] [8, 2], and the edges are: (1, 2) (1, 5) (1, 7) (2, 5) (3, 5) (4, 5) (7, 8). What is the maximum sum of the weights of three nodes? | ### 8 | [5, 10] | [0, 9] |
558 | 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, 1] [2, 8] [3, 9] [4, 4] [5, 7] [6, 4] [7, 2] [8, 2] [9, 9], and the edges are: (0, 1) (4, 7) (4, 8) (5, 7) (5, 6) (6, 7) (6, 9) (7, 9). What is the maximum sum of the weights of three nodes? | ### 15 | [5, 10] | [0, 9] |
800 | 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 14, weights of nodes are: [0, 2] [1, 10] [2, 2] [3, 3] [4, 6] [5, 3] [6, 3] [7, 4] [8, 7] [9, 9] [10, 10] [11, 8] [12, 7] [13, 6] [14, 3], and the edges are: (0, 2) (0, 5) (0, 9) (1, 6) (1, 12) (1, 8) (2, 7) (2, 12) (2, 10) (2, 14) (3, 9) (3, 5) (4, 13) (4, 9) (4, 8) (6, 8) (6, 11) (7, 9) (9, 12) (10, 11) (11, 14). What is the maximum sum of the weights of three nodes? | ### 20 | [10, 15] | [2, 21] |
802 | 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 11, weights of nodes are: [0, 4] [1, 8] [2, 2] [3, 9] [4, 5] [5, 5] [6, 5] [7, 10] [8, 3] [9, 10] [10, 4] [11, 1], and the edges are: (0, 2) (0, 4) (0, 10) (0, 9) (2, 6) (2, 4) (2, 10) (2, 11) (3, 5) (3, 9) (5, 7) (5, 11). What is the maximum sum of the weights of three nodes? | ### 11 | [10, 15] | [2, 21] |
804 | 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 13, weights of nodes are: [0, 6] [1, 5] [2, 3] [3, 3] [4, 2] [5, 8] [6, 9] [7, 8] [8, 3] [9, 2] [10, 1] [11, 6] [12, 7] [13, 7], and the edges are: (0, 1) (0, 9) (1, 10) (2, 3) (2, 8) (3, 13) (4, 7) (4, 5) (5, 10) (6, 13) (7, 10) (7, 13) (7, 9) (8, 9) (8, 10) (8, 13) (10, 13). What is the maximum sum of the weights of three nodes? | ### 16 | [10, 15] | [2, 21] |
806 | 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 12, weights of nodes are: [0, 2] [1, 7] [2, 1] [3, 1] [4, 8] [5, 5] [6, 7] [7, 7] [8, 4] [9, 1] [10, 4] [11, 1] [12, 9], and the edges are: (0, 8) (1, 8) (1, 12) (2, 11) (3, 10) (3, 11) (4, 7) (4, 6) (4, 8) (5, 7) (6, 8) (6, 12) (6, 9) (8, 9) (10, 11). What is the maximum sum of the weights of three nodes? | ### 19 | [10, 15] | [2, 21] |
808 | 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 12, weights of nodes are: [0, 2] [1, 5] [2, 4] [3, 3] [4, 9] [5, 10] [6, 5] [7, 5] [8, 3] [9, 1] [10, 8] [11, 8] [12, 2], and the edges are: (0, 1) (0, 8) (1, 4) (2, 5) (2, 4) (3, 5) (4, 8) (5, 10) (5, 7) (7, 10) (8, 9) (10, 11). What is the maximum sum of the weights of three nodes? | ### 23 | [10, 15] | [2, 21] |
810 | 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 13, weights of nodes are: [0, 9] [1, 4] [2, 10] [3, 3] [4, 8] [5, 2] [6, 10] [7, 3] [8, 2] [9, 6] [10, 8] [11, 6] [12, 6] [13, 5], and the edges are: (0, 12) (0, 8) (1, 9) (1, 2) (1, 5) (1, 13) (2, 9) (2, 5) (2, 8) (3, 9) (4, 11) (4, 10) (5, 13) (7, 9) (10, 11). What is the maximum sum of the weights of three nodes? | ### 22 | [10, 15] | [2, 21] |
812 | 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 13, weights of nodes are: [0, 7] [1, 6] [2, 4] [3, 7] [4, 3] [5, 9] [6, 7] [7, 5] [8, 1] [9, 4] [10, 10] [11, 8] [12, 10] [13, 4], and the edges are: (0, 2) (0, 5) (1, 12) (1, 6) (3, 12) (4, 13) (5, 11) (5, 6) (6, 12) (6, 11) (10, 11) (11, 13). What is the maximum sum of the weights of three nodes? | ### 24 | [10, 15] | [2, 21] |
814 | 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 12, weights of nodes are: [0, 6] [1, 1] [2, 10] [3, 10] [4, 1] [5, 6] [6, 3] [7, 3] [8, 4] [9, 9] [10, 10] [11, 3] [12, 2], and the edges are: (1, 5) (1, 10) (1, 9) (2, 12) (2, 8) (3, 4) (3, 12) (3, 10) (4, 9) (5, 7) (5, 11) (6, 10) (7, 11) (10, 11). What is the maximum sum of the weights of three nodes? | ### 12 | [10, 15] | [2, 21] |
816 | 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 14, weights of nodes are: [0, 1] [1, 2] [2, 6] [3, 5] [4, 5] [5, 9] [6, 5] [7, 3] [8, 1] [9, 4] [10, 3] [11, 10] [12, 6] [13, 6] [14, 6], and the edges are: (0, 1) (1, 11) (1, 10) (1, 3) (2, 11) (2, 14) (3, 8) (3, 4) (3, 10) (4, 8) (6, 11) (7, 12) (7, 13) (7, 8) (8, 10) (9, 11) (10, 14) (12, 14). What is the maximum sum of the weights of three nodes? | ### 11 | [10, 15] | [2, 21] |
818 | 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, 2] [2, 4] [3, 8] [4, 9] [5, 5] [6, 8] [7, 9] [8, 4] [9, 2], and the edges are: (0, 4) (0, 3) (0, 7) (0, 2) (1, 9) (2, 9) (3, 8) (3, 7) (4, 8). What is the maximum sum of the weights of three nodes? | ### 26 | [10, 15] | [2, 21] |
820 | 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 13, weights of nodes are: [0, 1] [1, 7] [2, 7] [3, 7] [4, 6] [5, 2] [6, 8] [7, 6] [8, 4] [9, 6] [10, 3] [11, 7] [12, 1] [13, 7], and the edges are: (0, 6) (0, 5) (0, 13) (1, 6) (1, 12) (1, 2) (1, 4) (2, 7) (2, 9) (4, 13) (4, 6) (4, 10) (5, 10) (5, 11) (6, 13) (7, 8) (7, 9) (11, 13). What is the maximum sum of the weights of three nodes? | ### 21 | [10, 15] | [2, 21] |
822 | 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 14, weights of nodes are: [0, 2] [1, 2] [2, 1] [3, 6] [4, 7] [5, 8] [6, 10] [7, 6] [8, 6] [9, 4] [10, 9] [11, 5] [12, 1] [13, 7] [14, 8], and the edges are: (0, 9) (0, 8) (1, 8) (1, 12) (1, 4) (2, 7) (2, 9) (2, 12) (3, 5) (3, 11) (3, 13) (4, 9) (4, 8) (5, 10) (6, 9) (6, 13) (7, 8) (7, 9) (10, 13) (11, 14). What is the maximum sum of the weights of three nodes? | ### 15 | [10, 15] | [2, 21] |
824 | 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 13, weights of nodes are: [0, 6] [1, 1] [2, 7] [3, 4] [4, 9] [5, 1] [6, 6] [7, 1] [8, 2] [9, 5] [10, 2] [11, 8] [12, 2] [13, 10], and the edges are: (0, 2) (0, 4) (0, 10) (2, 11) (2, 10) (2, 3) (3, 9) (5, 8) (6, 10) (7, 11) (8, 9) (10, 12). What is the maximum sum of the weights of three nodes? | ### 15 | [10, 15] | [2, 21] |
826 | 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 10, weights of nodes are: [0, 9] [1, 7] [2, 5] [3, 5] [4, 6] [5, 7] [6, 7] [7, 9] [8, 8] [9, 1] [10, 2], and the edges are: (3, 10) (3, 5) (5, 10). What is the maximum sum of the weights of three nodes? | ### 14 | [10, 15] | [2, 21] |
828 | 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 14, weights of nodes are: [0, 2] [1, 4] [2, 8] [3, 3] [4, 7] [5, 4] [6, 1] [7, 6] [8, 9] [9, 4] [10, 8] [11, 4] [12, 8] [13, 6] [14, 3], and the edges are: (0, 3) (0, 5) (1, 12) (1, 6) (1, 4) (2, 7) (2, 5) (3, 7) (4, 13) (4, 7) (4, 8) (4, 5) (4, 14) (4, 12) (5, 13) (5, 12) (6, 8) (6, 9) (6, 14) (8, 9) (9, 13). What is the maximum sum of the weights of three nodes? | ### 19 | [10, 15] | [2, 21] |
830 | 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, 10] [2, 9] [3, 10] [4, 9] [5, 9] [6, 7] [7, 5] [8, 1] [9, 6], and the edges are: (0, 8) (0, 5) (0, 4) (5, 9) (5, 8). What is the maximum sum of the weights of three nodes? | ### 19 | [10, 15] | [2, 21] |
832 | 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 11, weights of nodes are: [0, 3] [1, 6] [2, 7] [3, 2] [4, 1] [5, 10] [6, 1] [7, 9] [8, 8] [9, 1] [10, 10] [11, 6], and the edges are: (0, 10) (0, 8) (0, 1) (1, 5) (2, 6) (3, 5) (4, 7) (4, 11) (6, 9) (8, 10) (9, 11). What is the maximum sum of the weights of three nodes? | ### 21 | [10, 15] | [2, 21] |
834 | 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 14, weights of nodes are: [0, 1] [1, 4] [2, 2] [3, 3] [4, 4] [5, 4] [6, 7] [7, 6] [8, 4] [9, 7] [10, 1] [11, 3] [12, 6] [13, 10] [14, 9], and the edges are: (0, 3) (0, 13) (0, 5) (0, 1) (0, 8) (2, 3) (3, 8) (4, 6) (4, 12) (6, 13) (6, 9) (6, 10) (7, 10) (7, 11) (7, 8) (7, 13) (8, 14) (9, 14). What is the maximum sum of the weights of three nodes? | ### 8 | [10, 15] | [2, 21] |
836 | 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 14, weights of nodes are: [0, 5] [1, 8] [2, 8] [3, 2] [4, 6] [5, 1] [6, 8] [7, 8] [8, 10] [9, 6] [10, 8] [11, 2] [12, 1] [13, 2] [14, 9], and the edges are: (0, 12) (0, 6) (1, 11) (1, 6) (1, 9) (3, 5) (4, 12) (5, 10) (6, 11) (10, 12) (12, 14). What is the maximum sum of the weights of three nodes? | ### 18 | [10, 15] | [2, 21] |
838 | 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 13, weights of nodes are: [0, 7] [1, 2] [2, 6] [3, 7] [4, 1] [5, 4] [6, 7] [7, 3] [8, 7] [9, 7] [10, 8] [11, 9] [12, 3] [13, 2], and the edges are: (0, 13) (0, 10) (1, 4) (1, 11) (1, 13) (2, 4) (3, 8) (3, 10) (3, 9) (4, 10) (4, 11) (5, 7) (6, 11) (7, 9) (7, 12) (8, 9) (11, 12). What is the maximum sum of the weights of three nodes? | ### 21 | [10, 15] | [2, 21] |
840 | 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 14, weights of nodes are: [0, 9] [1, 3] [2, 8] [3, 6] [4, 4] [5, 3] [6, 6] [7, 2] [8, 6] [9, 4] [10, 6] [11, 6] [12, 10] [13, 6] [14, 6], and the edges are: (0, 7) (1, 12) (2, 14) (3, 11) (3, 10) (3, 7) (3, 8) (4, 9) (4, 5) (7, 8) (7, 11) (9, 11) (10, 13) (12, 13). What is the maximum sum of the weights of three nodes? | ### 14 | [10, 15] | [2, 21] |
842 | 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 12, weights of nodes are: [0, 6] [1, 7] [2, 9] [3, 5] [4, 10] [5, 9] [6, 2] [7, 1] [8, 10] [9, 8] [10, 7] [11, 6] [12, 7], and the edges are: (0, 10) (1, 10) (1, 11) (1, 7) (3, 7) (4, 6) (4, 10) (4, 7) (5, 10) (6, 8) (6, 7) (8, 12) (8, 11) (9, 11) (10, 12). What is the maximum sum of the weights of three nodes? | ### 13 | [10, 15] | [2, 21] |
844 | 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 14, weights of nodes are: [0, 6] [1, 5] [2, 2] [3, 1] [4, 3] [5, 7] [6, 4] [7, 10] [8, 10] [9, 10] [10, 7] [11, 4] [12, 1] [13, 8] [14, 3], and the edges are: (0, 6) (1, 11) (1, 4) (1, 3) (2, 8) (2, 4) (3, 7) (4, 5) (4, 7) (5, 10) (5, 14) (5, 12) (5, 9) (5, 11) (6, 10) (7, 12) (7, 8) (7, 10) (9, 13) (11, 13) (11, 12). What is the maximum sum of the weights of three nodes? | ### 12 | [10, 15] | [2, 21] |
846 | 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, 4] [1, 1] [2, 8] [3, 5] [4, 10] [5, 7] [6, 6] [7, 3] [8, 7] [9, 8], and the edges are: (0, 8) (2, 4) (2, 9) (3, 5) (4, 9) (4, 5) (5, 9) (6, 8). What is the maximum sum of the weights of three nodes? | ### 26 | [10, 15] | [2, 21] |
848 | 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 11, weights of nodes are: [0, 2] [1, 5] [2, 8] [3, 7] [4, 1] [5, 5] [6, 8] [7, 4] [8, 1] [9, 2] [10, 5] [11, 5], and the edges are: (0, 2) (0, 4) (1, 3) (1, 10) (2, 10) (2, 8) (2, 6) (3, 10) (4, 9) (7, 11) (9, 10). What is the maximum sum of the weights of three nodes? | ### 17 | [10, 15] | [2, 21] |
850 | 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 13, weights of nodes are: [0, 2] [1, 1] [2, 7] [3, 9] [4, 2] [5, 4] [6, 10] [7, 10] [8, 3] [9, 5] [10, 10] [11, 3] [12, 10] [13, 1], and the edges are: (0, 6) (1, 6) (1, 5) (1, 2) (1, 9) (6, 13) (6, 8) (8, 11) (8, 13). What is the maximum sum of the weights of three nodes? | ### 14 | [10, 15] | [2, 21] |
852 | 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 14, weights of nodes are: [0, 8] [1, 6] [2, 10] [3, 7] [4, 6] [5, 6] [6, 9] [7, 8] [8, 6] [9, 6] [10, 7] [11, 8] [12, 3] [13, 1] [14, 6], and the edges are: (0, 1) (0, 14) (0, 7) (0, 5) (2, 10) (2, 12) (2, 14) (3, 13) (3, 8) (3, 10) (4, 6) (4, 5) (4, 11) (5, 9) (6, 14) (8, 12) (9, 11) (12, 14). What is the maximum sum of the weights of three nodes? | ### 19 | [10, 15] | [2, 21] |
854 | 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 14, weights of nodes are: [0, 6] [1, 7] [2, 4] [3, 7] [4, 2] [5, 10] [6, 6] [7, 8] [8, 5] [9, 6] [10, 5] [11, 6] [12, 2] [13, 7] [14, 8], and the edges are: (0, 14) (0, 11) (0, 5) (1, 14) (1, 7) (3, 9) (4, 9) (4, 5) (4, 13) (5, 11) (5, 7) (6, 7) (6, 8) (8, 12). What is the maximum sum of the weights of three nodes? | ### 22 | [10, 15] | [2, 21] |
856 | 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 11, weights of nodes are: [0, 7] [1, 4] [2, 2] [3, 8] [4, 1] [5, 2] [6, 8] [7, 5] [8, 5] [9, 1] [10, 4] [11, 4], and the edges are: (1, 11) (1, 3) (2, 6) (2, 11) (2, 10) (3, 5) (3, 10) (3, 9) (4, 7) (5, 8) (6, 10) (7, 10) (8, 11). What is the maximum sum of the weights of three nodes? | ### 14 | [10, 15] | [2, 21] |
858 | 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 14, weights of nodes are: [0, 6] [1, 3] [2, 3] [3, 5] [4, 9] [5, 3] [6, 4] [7, 4] [8, 7] [9, 7] [10, 9] [11, 3] [12, 2] [13, 6] [14, 5], and the edges are: (0, 14) (0, 3) (0, 6) (0, 10) (1, 12) (1, 7) (2, 10) (2, 6) (3, 9) (3, 6) (4, 14) (4, 7) (4, 10) (5, 13) (7, 12) (7, 9) (8, 12). What is the maximum sum of the weights of three nodes? | ### 15 | [10, 15] | [2, 21] |
860 | 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, 1] [2, 9] [3, 8] [4, 3] [5, 6] [6, 10] [7, 5] [8, 2] [9, 1], and the edges are: (0, 6) (0, 5) (0, 4) (1, 2) (4, 6) (5, 7) (6, 8). What is the maximum sum of the weights of three nodes? | ### 15 | [10, 15] | [2, 21] |
862 | 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 13, weights of nodes are: [0, 8] [1, 4] [2, 4] [3, 7] [4, 2] [5, 6] [6, 5] [7, 10] [8, 2] [9, 10] [10, 4] [11, 6] [12, 8] [13, 10], and the edges are: (0, 2) (0, 7) (0, 11) (1, 9) (1, 11) (2, 4) (3, 10) (3, 4) (3, 11) (4, 7) (4, 6) (5, 8) (5, 10) (6, 12) (8, 11) (9, 11) (12, 13). What is the maximum sum of the weights of three nodes? | ### 20 | [10, 15] | [2, 21] |
864 | 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 12, weights of nodes are: [0, 9] [1, 1] [2, 1] [3, 6] [4, 4] [5, 3] [6, 9] [7, 10] [8, 7] [9, 2] [10, 5] [11, 10] [12, 4], and the edges are: (0, 8) (0, 7) (1, 6) (2, 10) (2, 11) (3, 7) (3, 6) (3, 5) (4, 8) (5, 7) (5, 10). What is the maximum sum of the weights of three nodes? | ### 19 | [10, 15] | [2, 21] |
866 | 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 13, weights of nodes are: [0, 3] [1, 4] [2, 3] [3, 4] [4, 8] [5, 1] [6, 5] [7, 5] [8, 6] [9, 5] [10, 1] [11, 6] [12, 1] [13, 3], and the edges are: (0, 4) (0, 8) (0, 5) (0, 12) (1, 6) (1, 5) (3, 13) (3, 5) (4, 8) (4, 6) (4, 13) (5, 12) (5, 11) (6, 11) (6, 13) (7, 13) (8, 9). What is the maximum sum of the weights of three nodes? | ### 17 | [10, 15] | [2, 21] |
868 | 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 10, weights of nodes are: [0, 4] [1, 4] [2, 1] [3, 4] [4, 1] [5, 9] [6, 10] [7, 6] [8, 9] [9, 5] [10, 6], and the edges are: (0, 7) (0, 2) (1, 4) (2, 7) (2, 9) (3, 9) (4, 6) (5, 10). What is the maximum sum of the weights of three nodes? | ### 11 | [10, 15] | [2, 21] |
870 | 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 13, weights of nodes are: [0, 10] [1, 8] [2, 8] [3, 7] [4, 10] [5, 5] [6, 9] [7, 9] [8, 1] [9, 8] [10, 10] [11, 5] [12, 5] [13, 6], and the edges are: (0, 11) (1, 8) (1, 4) (2, 13) (3, 12) (3, 11) (3, 6) (4, 6) (4, 7) (4, 12) (6, 9) (6, 10) (6, 11) (8, 11) (9, 12) (9, 10) (9, 13). What is the maximum sum of the weights of three nodes? | ### 27 | [10, 15] | [2, 21] |
872 | 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 13, weights of nodes are: [0, 9] [1, 1] [2, 10] [3, 6] [4, 9] [5, 6] [6, 5] [7, 5] [8, 1] [9, 2] [10, 7] [11, 1] [12, 7] [13, 6], and the edges are: (0, 7) (0, 10) (1, 6) (1, 11) (1, 5) (2, 9) (3, 8) (3, 12) (4, 5) (5, 12) (6, 11) (7, 9) (8, 9) (11, 13). What is the maximum sum of the weights of three nodes? | ### 7 | [10, 15] | [2, 21] |
874 | 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 10, weights of nodes are: [0, 5] [1, 9] [2, 10] [3, 2] [4, 1] [5, 2] [6, 8] [7, 5] [8, 4] [9, 2] [10, 5], and the edges are: (1, 4) (2, 8) (3, 8) (3, 7) (3, 10) (6, 7) (6, 9) (7, 8). What is the maximum sum of the weights of three nodes? | ### 11 | [10, 15] | [2, 21] |
876 | 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 11, weights of nodes are: [0, 3] [1, 8] [2, 7] [3, 10] [4, 5] [5, 6] [6, 1] [7, 5] [8, 3] [9, 6] [10, 3] [11, 8], and the edges are: (0, 7) (0, 5) (0, 2) (0, 10) (2, 11) (2, 9) (2, 10) (4, 8) (4, 9) (5, 10) (6, 11) (7, 9) (8, 11). What is the maximum sum of the weights of three nodes? | ### 13 | [10, 15] | [2, 21] |
878 | 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, 5] [2, 1] [3, 3] [4, 9] [5, 10] [6, 2] [7, 8] [8, 5] [9, 2], and the edges are: (0, 9) (0, 1) (1, 8) (1, 9) (1, 7) (2, 9) (3, 9) (4, 7) (7, 8). What is the maximum sum of the weights of three nodes? | ### 18 | [10, 15] | [2, 21] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.