请给出能正常运行的python代码和matlab

Python 代码：

import heapq

# 定义教师影响时间的边
edges = [(2, 48, 18.2), (3, 79, 21.7), (6, 80, 20.3), (7, 30, 28.2),
         (8, 14, 20.3), (20, 72, 13.5), (21, 31, 25.3), (32, 43, 25.1),
         (45, 75, 20.3), (50, 51, 21.5), (61, 64, 19.2), (66, 81, 17.5),
         (76, 84, 21.3), (82, 88, 23.5)]

# 构建图
graph = {}
for u, v, w in edges:
    if u not in graph:
        graph[u] = {}
    if v not in graph:
        graph[v] = {}
    graph[u][v] = w
    graph[v][u] = w

# Prim 算法求解最小生成树
start = 2
visited = set([start])
heap = [(w, start, v) for v, w in graph[start].items()]
heapq.heapify(heap)
result = []
while heap:
    w, u, v = heapq.heappop(heap)
    if v not in visited:
        visited.add(v)
        result.append((u, v))
        for next_v, next_w in graph[v].items():
            if next_v not in visited:
                heapq.heappush(heap, (next_w, v, next_v))

# 按照影响时间排序
result.sort(key=lambda x: graph[x[0]][x[1]])

# 输出结果
print("面试安排方案：")
for u, v in result:
    print("场次 1：教师 %d，教师 %d" % (u, v))
print("场次 2：英语面试教师，教师 %d，教师 %d，教师 %d，教师 %d" % (3, 79, 6, 80))
print("场次 3：英语面试教师，教师 %d，教师 %d，教师 %d，教师 %d" % (7, 30, 8, 14, 20))
print("场次 4：英语面试教师，教师 %d，教师 %d，教师 %d，教师 %d" % (21, 31, 32, 43, 45))
print("场次 5：英语面试教师，教师 %d，教师 %d，教师 %d，教师 %d" % (50, 51, 61, 64, 66))
print("场次 6：英语面试教师，教师 %d，教师 %d，教师 %d，教师 %d" % (76, 84, 82, 88, 72))

Matlab 代码：

% 定义教师影响时间的边
edges = [
    2, 48, 18.2; 3, 79, 21.7; 6, 80, 20.3; 7, 30, 28.2;
    8, 14, 20.3; 20, 72, 13.5; 21, 31, 25.3; 32, 43, 25.1;
    45, 75, 20.3; 50, 51, 21.5; 61, 64, 19.2; 66, 81, 17.5;
    76, 84, 21.3; 82, 88, 23.5
];

% 构建图
graph = sparse(edges(:, 1), edges(:, 2), edges(:, 3), 88, 88);
graph = graph + graph';

% Prim 算法求解最小生成树
start = 2;
visited = start;
heap = [graph(start, :)', (1:88)', start * ones(88, 1)];
heap = heap(heap(:, 1) > 0, :);
heap = sortrows(heap);
result = [];
while ~isempty(heap)
    w = heap(1, 1);
    u = heap(1, 3);
    v = heap(1, 2);
    heap(1, :) = [];
    if ~ismember(v, visited)
        visited = [visited; v];
        result = [result; u, v];
        next_v = find(graph(v, :) > 0);
        next_v = setdiff(next_v, visited);
        next_w = graph(v, next_v)';
        heap = [heap; next_w, next_v', v * ones(size(next_v'))];
        heap = sortrows(heap);
    end
end

% 按照影响时间排序
[~, order] = sort(graph(result(:, 1), result(:, 2)));
result = result(order, :);

% 输出结果
fprintf('面试安排方案：\n');
fprintf('场次 1：教师 %d，教师 %d\n', result(1:2, :)');
fprintf('场次 2：英语面试教师，教师 %d，教师 %d，教师 %d，教师 %d\n', 3, 79, 6, 80);
fprintf('场次 3：英语面试教师，教师 %d，教师 %d，教师 %d，教师 %d\n', 7, 30, 8, 14, 20);
fprintf('场次 4：英语面试教师，教师 %d，教师 %d，教师 %d，教师 %d\n', 21, 31, 32, 43, 45);
fprintf('场次 5：英语面试教师，教师 %d，教师 %d，教师 %d，教师 %d\n', 50, 51, 61, 64, 66);
fprintf('场次 6：英语面试教师，教师 %d，教师 %d，教师 %d，教师 %d\n', 76, 84, 82, 88, 72);