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?