在NetworkX中,我试图完成以下任务:
到目前为止,我已经完成了第一部分的工作,第二部分michaelg非常有用,但是仍然有一个错误。你知道吗
import networkx as nx
from itertools import product
# Mother-nodes
M = [('E_%d' % h, {'a': i, 'b': j, 'c': k, 'd': l})
for h, (i, j, k, l) in enumerate(product(range(2), repeat=4), start=1)]
# children-nodes
a = [ ( 'a_%d' % i, {'a' : i}) for i in range(0,2) ]
b = [ ( 'b_%d' % i, {'b' : i}) for i in range(0,2) ]
c = [ ( 'c_%d' % i, {'c' : i}) for i in range(0,2) ]
d = [ ( 'd_%d' % i, {'d' : i}) for i in range(0,2) ]
# graph containing both
M_c = nx.Graph()
M_c.add_nodes_from(M)
ls_children = [a, b, c , d]
for ls_c in ls_children:
M_c.add_nodes_from(ls_c)
# what it looks like so far
list(M_c.nodes(data=True))[0:20]
[('E_9', {'a': 1, 'b': 0, 'c': 0, 'd': 0}),
('d_0', {'d': 0}),
('E_10', {'a': 1, 'b': 0, 'c': 0, 'd': 1}),
('b_0', {'b': 0}),
('E_2', {'a': 0, 'b': 0, 'c': 0, 'd': 1}),
('E_1', {'a': 0, 'b': 0, 'c': 0, 'd': 0}),
('c_1', {'c': 1}),
...
]
然后是第二部分,产生了一个错误:
for start in M_c.nodes(data=True):
for end in M_c.nodes(data=True):
for attr in list(start[1].keys()):
if start[1][attr]:
if end[1][attr]:
if start[1][attr] == end[1][attr]:
M_c.add_edge(start[0], end[0] )
# Adding an else and continue statement does not affect the error,
# even adding three of them, for each if statement
# else:
# continue
---------------------------------------------------------------------------
KeyError Traceback (most recent call last)
<ipython-input-5-32ae2a6095e5> in <module>()
3 for attr in list(start[1].keys()):
4 if start[1][attr]:
----> 5 if end[1][attr]:
6 if start[1][attr] == end[1][attr]:
7 M_c.add_edge(start[0], end[0] )
KeyError: 'a'
我可能忽略了什么-任何建议都非常感谢。你知道吗
编辑-1:
正如杜明建议的那样,我跑了:
for mother_node in M:
for child_node in chain(a, b, c, d):
if child_node[1].items() <= mother_node[1].items():
M_c.add_edge(child_node, mother_node)
返回此错误:
---------------------------------------------------------------------------
TypeError Traceback (most recent call last)
<ipython-input-6-24f1a24a49e8> in <module>()
2 for child_node in chain(a, b, c, d):
3 if child_node[1].items() <= mother_node[1].items():
----> 4 M_c.add_edge(child_node, mother_node)
5
/usr/local/lib/python3.5/dist-packages/networkx/classes/graph.py in add_edge(self, u_of_edge, v_of_edge, **attr)
873 u, v = u_of_edge, v_of_edge
874 # add nodes
--> 875 if u not in self._node:
876 self._adj[u] = self.adjlist_inner_dict_factory()
877 self._node[u] = {}
TypeError: unhashable type: 'dict'
如果一个节点是一个母节点,它总是拥有所有4个属性
a, b, c, d
,而子节点只有一个属性。所以可能是dictstart[1]
有键attr
,而end[1]
没有。你知道吗为了在母节点和子节点之间正确地添加边,我们需要迭代所有可能的对(母节点、子节点),然后检查子节点的属性dict是否是母节点属性dict的子dict。你知道吗
验证结束节点中是否存在该属性
由于迭代开始节点的属性,因此还需要验证其在结束节点中的存在性:
以下是修改后的代码:
相关问题 更多 >
编程相关推荐