[algogeeks] Fastest Method to implement graphs in C++

I was about to start implemening max flor min cut and shortest path graphs in C++ and I was wondering whats the most efficient way to do it that will reduce the run time. So far I know I have to use Fibonacci heap to make it fast. Does anybody have any other suggestions? Does anyone know of any

[algogeeks] Re: Run-time for SP algorithms dependent on computer speed?

Thanks for your input Adak. I'm just wondering that how much of a difference will it create by using better hardware. No matter how fast the computer is, at the end of the day, if the algorithm is inefficient, it won't bring too much of a difference. Would it help if I am able to tell you the

[algogeeks] Run-time for SP Algorithms

I was actually trying to see the runtime for certain SP algorithms. However, so far, I've been checking them on my pc with the algorithms being implemented in Java. I was wondering how much of a difference will there be if they are implemented in C++ and ran on unix instead. What about better com

[algogeeks] Run-time for SP algorithms dependent on computer speed?

I'm running some of the shortest path algorithms on my personal laptop (1.6 GHZ core duo) and I get an average run time of 100 ms for the data set that I have. I am wondering if the same program is ran on a much bigger/faster computer then the run time will be any faster. If so, how much faster?

[algogeeks] Which Books is the best?

I know that for algorithms, usuall;y its the the cormann book considerd to be the best, however, I was wondering if anyone knew of the Algorithms book by ROBERT SEDGEWICK? If its as good, different, better/worst? --~--~-~--~~~---~--~~ You received this message bec

[algogeeks] Re: cormen solutions

Thanks, This one is helpgul On Sep 3, 7:36 am, rlacsd <[EMAIL PROTECTED]> wrote: > u can download them from my site asees.275mb.com > > On Sep 1, 8:40 pm, rahul <[EMAIL PROTECTED]> wrote: > > > > > can neone give me link to cormen solutions pls > > its very urgent > > pls give me link at [EMAIL

[algogeeks] Re: Finding a single repeated element in an array

Amazing, I love your solution. Good call Vaibhav On Aug 17, 12:51 am, "Vaibhav Jain" <[EMAIL PROTECTED]> wrote: > if u know the range of values stored in array then > let me assume values 1 to k then u can calculate sum of numbers stored in > array in O(n) complexity. > after that apply formul

[algogeeks] Re: graph theory

Since it s a DAG, just multiply all the edge weights by -1. Then use dijkstra's to find the min shortest path. Wether some of the edge weights are negative or not, it shouldn't effect the solution as when using dijkstra's, we take the min node potentials. ,--- This can be proven On Aug

[algogeeks] Fastest known implementation and algorithm for the shortest path

I'm trying to implement this in java. Given N nodes and M arcs, whats the fastest known implementation for the shortest path. I'm currently making use of the jgrapht library for java. The link is given below. http://jgrapht.sourceforge.net/ Any suggestion will be much appreciated. --~--~

[algogeeks] Re: Implementation of Dijkstra and other shortest path problems.

t; Implements yourself please. > > On 7/21/07, TheTravellingSalesman <[EMAIL PROTECTED]> wrote: > > > > > I'm using Java programming language and I'm trying to implement the > > shortest path algorithm. > > > One thing I'm struggling with is h

[algogeeks] Re: A Hard proof but makes intuitive sense

gt; so we can connect Ta1 and Ta2 with e' to get a spanning tree of smaller > weight than Ta. > > On 7/9/07, TheTravellingSalesman <[EMAIL PROTECTED]> wrote: > > > > > Prov

[algogeeks] Re: what is total number of permutation

I find the question to be quiet interesting actually. I'm just not to clear with one part of the question though You want the result something like this _ _ _ _ _ _ _ _ (8 spaces) where each space contains one of the sorted lists. WHat do you mean that both lists are sorted independently? D

[algogeeks] Implementation of Dijkstra and other shortest path problems.

I'm using Java programming language and I'm trying to implement the shortest path algorithm. One thing I'm struggling with is how do I represent nodes and edges in Java. Don't know of too many Java classes for Graph theory. Also, what kind of data sturcture should I use. I was told that Queue is

[algogeeks] A Hard proof but makes intuitive sense

Prove that there is a unique minimum spanning tree on a connected undirected graph when the edge weights are unique. === Makes intuitive sense but yet, I'm having a hard time trying to prove it. I tried induction but I'