🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Thread View: comp.lang.c++.leda
1 messages
1 total messages Started by Daniel Leroux Mon, 28 Aug 1995 21:05
execution time (abnormaly long)
#58
Author: Daniel Leroux
Date: Mon, 28 Aug 1995 21:05
26 lines
969 bytes
Hello,
 
I wrote a graph partitionning algorithm with LEDA.
The program works well, except that it takes
a lot of time to execute. I don't know if it's
LEDA structures that "slows" the execution, or
simply the way I wrote the code.
 
The structures that I use are:
        GRAPHS (graph.h)
        priority queues (p_queue.h)
        sorted sequences (sortseq.h)
        arrays (array.h)
        stacks (stack.h)
 
 
If you face a similar "time execution problem", please e-mail me at:
leroux@iro.umontreal.ca
 
 
Best Regards
Daniel
--
Daniel Leroux
VLSI lab, Informatique
Universite de Montreal
Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads