I think you are to apply Dijkstra's algorithm on the flows of the network (not the capacities). Here the flows would be the latency and the capacity would be the maximum latency possible. When you apply Dijkstra's algorithm you would essentially find all the latencies to every node in the network. Fortunately, Dijkstra is an easy algorithm. Check out this link for implementation details, http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm.
--- "srikanth.dasari" <[EMAIL PROTECTED]> wrote: > Hi guys..please help me..on this very comlex c > program..for this > algorithm > > "Apply dijkastra's algorithm n every netwrk and Nj(nodes) > to find the > shortest path in terms of Dij(transmission delay from i > to j) > and use this path in the formula for the quickest path > delay > pick the minimum of the above. > Nj is a graph which contains only those (links) with > capacity > greater or equal of cj" > > I really would appreciate the person who can solve > this..my sincere > thanks to him in advance.. > > srikanth > > > _________________ Joseph A. Marrero http://www.l33tprogrammer.com/ ____________________________________________________________________________________ Sucker-punch spam with award-winning protection. Try the free Yahoo! Mail Beta. http://advision.webevents.yahoo.com/mailbeta/features_spam.html
