If i have a number of routers connected by internet lines (with speed associated as weight)- oriented graph - and need to calculate a "path" between routers that:
1. Allows a router to send messages to any another router (it can cross other routers)
2. Have the minimum number of elements possible
3. Maximize the sum of speeds in the lines.
What graph algorithms should i use? Any ideas?
What choices have you considered so far ?
http://www.nist.gov/dads/, use the local search for "graph" and see what you can come up with in terms of an algorithm.
Thanks for the link, i'll take a look at it.
I'm inclined for the ford-fulkerson algorithm but i'm not sure...
Why do I get the feeling that this is an attempt to disguise homework?
> I'm inclined for the ford-fulkerson algorithm but i'm not sure
Sounds like a good plan to me.
Even if it turns out to be wrong, you'll learn a lot more about the problem.