Member Avatar for rt.arti

Hello,

I am working on a network design problem (min-cost flow) to find the shortest paths for every set of start and destination nodes. Based on the set of inputs (arcs--(which are of the form (start,end) ) and cost) the program calculates the minimum cost from the start to destination (which is again specified as input parameters).

The program computes the correct set of costs in some instances by picking up the right values.
eg.
if the following are specified in the input --
start= 1
destination=11
//ARCS
1 11 0.3063
1 2 0.2205
2 11 0.1110

The program prints out cost from 1 to 11 as 0.3315 instead of 0.3063
However it computes the correct results in some cases. Please let me know of some ideas of where the problem could be.

Thanks in advance!

  • 2 Contributors
  • 1 Reply
  • 93 Views
  • 9 Hours Discussion Span
  • Latest Post Latest Post by Dave Sinkula
Member Avatar for Dave Sinkula

Line 42?

How about posting a small but compilable snippet that demonstrates the problem?

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.