Suppose NASA wants to link n stations spread out over the solar system using fre

Question

Suppose NASA wants to link n stations spread out over the solar system using free-space optical communication, which is a technology that involves shooting lasers through space between pairs of stations to facilitate communication. Naturally, the energy needed to connect two stations in this way depends on the distance between them, with some connections requiring more energy than others. Therefore, each pair of stations has a different known energy that is needed to allow this pair of stations to communicate. NASA wants to connect all these stations together using the minimum amount of energy possible. Describe an algorithm for constructing such a communication network in O(n 2 ) time. (The gas used to travel between stars is not included in the cost.) Explain the idea only

Explanation / Answer

This problem can be solved by Djkstra's Shortest path algorithm
This algorithm can help in finding shortest path between any pair of stations and can be acheived in O(n2) time

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.