Internet connection

"""https://cses.fi/345/task/B"""
from __future__ import print_function
import sys

def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)

def get_path_with_dfs(adj_matrix, V):
    """DFS uses a stack/list. BFS uses a queue."""
    root = 1  # Teemu
    target = V  # Taina
    seen = []  # Stuff you've seen.
    to_visit = [root]
    path = []
    while to_visit:
        v = to_visit.pop()  # Pop last inserted element.
        seen.append(v)
        found = False
        for neighbor in range(1, V+1):
            weight = adj_matrix[v][neighbor]
            if (weight < 1) or (neighbor in seen) or (neighbor in path):
                continue
            eprint(f"weight from {v} to {neighbor} is {weight}")
            found = True
            if neighbor == target:
                path.append(v)
                path.append(target)
                return path
            to_visit.append(neighbor)
            eprint('to visit', to_visit)
        if found:
            path.append(v)
            eprint("FOUND: path is ", path)
    return None  # No path found


def max_rate(adj_matrix, V):
    total_max_rate = 0
    path = get_path_with_dfs(adj_matrix, V)
    while path:
        eprint("path", path)
        path_weights = []
        for i in range(len(path)-1):
            a, b = path[i], path[i+1]
            assert(adj_matrix[a][b] == adj_matrix[b][a])
            weight = adj_matrix[a][b]
            path_weights.append(weight)
        eprint('weights', path_weights)

        max_rate = min(path_weights)
        total_max_rate += max_rate
        # Deduct the max_rate from all weights
        for i in range(len(path)-1):
            a, b = path[i], path[i+1]
            adj_matrix[a][b] -= max_rate
            adj_matrix[b][a] -= max_rate
        path = get_path_with_dfs(adj_matrix, V)
    eprint(int(total_max_rate))
    return


# Read number oof vertices (computers) and edges (connections).
V, E = [int(x) for x in input().split()]
adj_matrix = [[0 for i in range(V + 1)] for i in range(V + 1)]
for i in range(E):
    a, b, weight = [int(x) for x in input().split()]
    adj_matrix[a][b] = weight
    adj_matrix[b][a] = weight
max_rate(adj_matrix, V)

Test 1

Verdict: WRONG ANSWER

weight from 1 to 2 is 78
to visit [2]
weight from 1 to 4 is 14
to visit [2, 4]
weight from...

Test 2

Verdict: WRONG ANSWER

weight from 1 to 2 is 88
to visit [2]
weight from 1 to 10 is 22
path [1, 10]
weights [22]...

Test 3

Verdict: WRONG ANSWER

weight from 1 to 2 is 26
to visit [2]
weight from 1 to 6 is 3
to visit [2, 6]
FOUND: path...

Test 4

Verdict: WRONG ANSWER

weight from 1 to 2 is 89
to visit [2]
weight from 1 to 8 is 80
to visit [2, 8]
FOUND: path...

Test 5

Verdict: WRONG ANSWER

weight from 1 to 2 is 53
to visit [2]
weight from 1 to 8 is 22
to visit [2, 8]
weight from...

Test 6

Verdict: WRONG ANSWER

weight from 1 to 2 is 636542018
to visit [2]
weight from 1 to 9 is 517915875
to visit [2,...

Test 7

Verdict: WRONG ANSWER

weight from 1 to 2 is 725914394
to visit [2]
weight from 1 to 9 is 317534926
to visit [2,...

Test 8

Verdict: WRONG ANSWER

weight from 1 to 2 is 387326445
to visit [2]
weight from 1 to 7 is 862213124
to visit [2,...

Test 9

Verdict: WRONG ANSWER

weight from 1 to 2 is 963511849
to visit [2]
weight from 1 to 4 is 219769993
to visit [2,...

Test 10

Verdict: WRONG ANSWER

weight from 1 to 2 is 434654854
to visit [2]
weight from 1 to 4 is 663665104
to visit [2,...

Test 11

Verdict: WRONG ANSWER

weight from 1 to 2 is 1
path [1, 2]
weights [1]
1

Test 12

Verdict: WRONG ANSWER

weight from 1 to 2 is 1
path [1, 2]
weights [1]
1

Test 13

Verdict: WRONG ANSWER

weight from 1 to 2 is 1
path [1, 2]
weights [1]
1

Test 14

Verdict: WRONG ANSWER

weight from 1 to 2 is 539540023
to visit [2]
weight from 1 to 9 is 962769780
to visit [2,...

Test 15

Verdict: WRONG ANSWER

weight from 1 to 2 is 2
to visit [2]
weight from 1 to 3 is 5
to visit [2, 3]
FOUND: path i...

Test 16

Verdict: WRONG ANSWER

0

Test 17

Verdict: WRONG ANSWER

0

Test 18

Verdict: WRONG ANSWER

weight from 1 to 2 is 1000000000
to visit [2]
weight from 1 to 3 is 1000000000
to visit [2...

Test 19

Verdict: WRONG ANSWER

weight from 1 to 2 is 1000000000
to visit [2]
FOUND: path is  [1]
weight from 2 to 3 is 10...

Test 20

Verdict: WRONG ANSWER

weight from 1 to 2 is 1
path [1, 2]
weights [1]
1

Test 21

Verdict: WRONG ANSWER

weight from 1 to 2 is 1000000000
to visit [2]
weight from 1 to 3 is 1000000000
to visit [2...

Test 22

Verdict: WRONG ANSWER

weight from 1 to 2 is 1000000000
to visit [2]
weight from 1 to 3 is 1000000000
to visit [2...