[cl-graph-devel] Re: defsystem connection error

Gary King gwking at metabang.com
Tue Feb 21 13:23:12 UTC 2006


Hi David,

What Lisp / profiler are you using.


On Feb 21, 2006, at 7:15 AM, David Wallin wrote:

> At Mon, 20 Feb 2006 23:06:29 -0500,
> Gary King <gwking at metabang.com> wrote:
>>> darcs failed:  Not a repository: http://common-lisp.net/project/cl-
>>> containers/metabang.bind/darcs/metabang.bind
>>>
>>> Has this package moved?
>>
>> Ack. Yes. That's my bad. I moved metabang.bind to metabang-bind. I
>> should have left a link in something. My apologies.
>>
>
> That fixed the problem, thanks.
>
>>> Is there any way to speed up `delete-vertex'? I've been profiling
>>> my code and delete-vertex seem to be a serious bottleneck.
>>
>> It depends... Delete-vertex can be called with a "value" (in which
>> case it calls find-vertex) or an actual vertex. The latter is faster.
>
> The latter is what I'm using. Unfortunately :)
>
>> The method on vertexes deletes the vertex's edges and does a bit of
>> additional bookkeeping. There is a bit of error checking that could
>> probably be ignored in some cases. There is also some redundancy. For
>> example, the code to delete an edge involves removing the edge from
>> its two vertexes. Since the vertex being deleted is going to have all
>> of its edges wiped in any case, it might make sense to have some
>> special methods that get called only by the internal deletion  
>> machinery.
>>
>> Does that make sense? Can you describe the sort of graphs with which
>> you are working?
>
> It does make sense. The graph itself is easy to explain, it's a  
> fully connected graph that grows and contracts over time.
>
> I'll do a bit of investigation myself, but CLOS is a daunting beast.
>
> cheers,
>
> --david.


-- 
Gary Warren King
metabang.com
http://www.metabang.com/





More information about the cl-graph-devel mailing list