Re: [Jung-support] performance techniques implemented in Jung

[Joshua O'M. <jos...@gm...>]

Luc:

I don't know how to answer this question, because you don't define
"efficient", nor "performance techniques".

I mean, I can certainly talk about decisions that JUNG has made on several
levels in terms of the data structures that it uses, or the algorithmic
approaches in various contexts.  (And I can talk about approaches that we
don't currently use, but should.)

But that's potentially a very lengthy discussion/lecture and I don't have
the time right now to go into all of that.  Some of it, perhaps...if I knew
which parts were of interest.

Also, of course, I assume you're aware that the code is there for the
reading.  :)

So if you are particularly interested in this topic, please make it more
clear what you're interested in.

Joshua


On Mon, Oct 28, 2013 at 2:56 AM, Luc Hogie <Luc...@in...> wrote:

> Good morning,
>
> I'm interested in performance techniques for graph algorithms. In
> particular I would like to know what have been made into the Jung
> library to make it efficient.
>
> Regards,
> Luc.
>
>
>
> ------------------------------------------------------------------------------
> October Webinars: Code for Performance
> Free Intel webinars can help you accelerate application performance.
> Explore tips for MPI, OpenMP, advanced profiling, and more. Get the most
> from
> the latest Intel processors and coprocessors. See abstracts and register >
> http://pubads.g.doubleclick.net/gampad/clk?id=60135991&iu=/4140/ostg.clktrk
> _______________________________________________
> Jung-support mailing list
> Jun...@li...
> https://lists.sourceforge.net/lists/listinfo/jung-support
>



-- 
jos...@gm.........sites.google.com/site/joshuaomadadhain/
   Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall
It's that moment of dawning comprehension that I live for.  -- Bill
Watterson
 My opinions are too rational and insightful to be those of any
organization.