关于python字典的描述中错误的是_Python运行时错误字典

import sys

from collections import defaultdict

from bisect import insort

graph = defaultdict(list)

edges = []

with open("blu.txt") as f:

for line in f:

(key, val) = line.split()

graph[key].append(val)

graph[val].append(key)

edges.append((key, val))

k = 3

change = True

while change:

change = False

for edge in edges:

inter = set(graph[edge[0]]).intersection(graph[edge[1]])

if len(inter) < (k - 2):

if edge[1] in graph[edge[0]]:

graph[edge[0]].remove(edge[1])

change = True

if edge[0] in graph[edge[1]]:

graph[edge[1]].remove(edge[0])

change = True

g = dict((key, value) for key, value in graph.items() if value)

for key, v in g.items():

for k, value in g.items():

if key in value:

g.pop(key, None)

for key, value in g.items():

a = []

insort(a, key)

for v in value:

insort(a, v)

print (tuple(a))

# for x in graph:

# print (x, graph[x])

# def generate_edges(graph):

# edges = []

# for k in graph:

# for neighbour in graph[k]:

# edges.append((k, neighbour))

# return edges

# print(generate_edges(graph))

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值