On Mon, Dec 7, 2009 at 5:48 PM, Steven D'Aprano
wrote:
> On Mon, 07 Dec 2009 17:23:24 -0500, geremy condra wrote:
>
>
>>> * Graph.__iter__ could be mapped to an iterator using
>>> the fastest traversal method for the graph nodes (ie. order does not
>>> matter, it's only important that all nod
On Mon, 07 Dec 2009 17:23:24 -0500, geremy condra wrote:
>> * Graph.__iter__ could be mapped to an iterator using
>> the fastest traversal method for the graph nodes (ie. order does not
>> matter, it's only important that all nodes are found as fast as
>> possible)
>
> Again, it seems amb
On Mon, Dec 7, 2009 at 2:51 PM, M.-A. Lemburg wrote:
> geremy condra wrote:
>> How interested are you in a C port of graphine? I haven't had
>> any specific requests for it, but if its something you need I
>> can shuffle it towards the top of the to do pile.
>
> There are two main reasons for a C
geremy condra wrote:
> How interested are you in a C port of graphine? I haven't had
> any specific requests for it, but if its something you need I
> can shuffle it towards the top of the to do pile.
There are two main reasons for a C implementation:
1. performance
2. memory footprint
These
