python bijection

[geremy condra]

On Fri, Dec 4, 2009 at 3:10 PM, Lie Ryan <lie.1296 at gmail.com> wrote:
> On 12/5/2009 6:53 AM, geremy condra wrote:
>>
>> To be fair, I don't think you'd have to look very far to find places
>> where a graph representation is approximated using some
>> combination of dicts, sets, and lists. ElementTree comes to mind
>> immediately, and the dict-of-dicts idea for logging recently
>> discussed on python-dev explicitly states that it uses that
>> structure to represent object graphs. To me that says that there
>> is at least some demand.
>
> Though I've never used ElementTree extensively before, I thought it was
> supposed to use a Tree structure (though it is a subset of graph, the need
> for tree is much more common than full-blown graph package).

Sure, its a tree, which is also a graph. In this case it looks to
me more like a directed acyclic graph than anything, but its
pretty much just semantics since the interface is functionally
equivalent.

Geremy Condra