给定图中使用非重复边连接两点的所有路径计算

给定图中使用非重复边连接两点的所有路径计算

def get_non_repeating_paths4two_nodes(paths:list, s:str, e:str)->list:
    '''
    返回用paths中的非重复边，且每条非重复边最多使用一次，来连接两节点的所有路径的列表
    '''
    if paths == []:
        return []
    else:
        edges = [paths[0]] # 存放可用的边
        for i in range(1,len(paths)):
            if paths[i] in paths[:i]:
                pass
            else:
                edges.append(paths[i])
        #print("非重复边数量：",len(edges))
        start_edges = []
        end_edges = []
        for i in edges:
            if i[0] == s:
                start_edges.append(i)
            if i[1] == e:
                end_edges.append(i)
            
        if (start_edges ==