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
