execution time (abnormaly long)

Article View: comp.lang.c++.leda

Article #58

Back to comp.lang.c++.leda Previous Next

#58

From: 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

Technical Details

Message-ID: <DE1H8x.6I1@IRO.UMontreal.CA>

Path: arc1-ca.pugleaf.net!carre.IRO.UMontreal.CA!leroux

Show Full Headers

Complete Article Headers

Newsgroups: comp.lang.c++.leda
Path: arc1-ca.pugleaf.net!carre.IRO.UMontreal.CA!leroux
From: leroux@IRO.UMontreal.CA (Daniel Leroux)
Subject: execution time (abnormaly long)
Message-ID: <DE1H8x.6I1@IRO.UMontreal.CA>
Sender: news@IRO.UMontreal.CA
Organization: Universite de Montreal
X-Newsreader: TIN [version 1.2 PL2]
Date: Mon, 28 Aug 1995 21:05:20 GMT