METAL XXX added the comment:
How about fixing set.__repr__ ?
--
nosy: +metal
___
Python tracker
<http://bugs.python.org/issue2333>
___
___
Python-bugs-list mailin
METAL XXX added the comment:
Shame on me, after a long time I realized the problem referenced in my old post
(http://bugs.python.org/msg102019) was actually topological sorting. It can't
be done by Python's sort(), which doesn't support partial order. Trying to use
c
METAL XXX added the comment:
Sorry I ripped the code from a mess and I forget the tree is "leaflized" as
tree = {
'A': set(['B', 'C', 'D', 'E']),
'B': set(['D', 'E']),
'C': set(),
&#x
METAL XXX added the comment:
I have a tree:
A
/ \
B C
/ \
D E
which is implemented as a dict
tree = {
'A': set(['B', 'C']),
'B': set(['D', 'E']),
'C': set(),
'D': set(),
'E': set()
