Robert C. Prim was a computer scientist whose Prim's algorithm constructs a minimum spanning tree. Starting from one vertex, it repeatedly adds a least-weight edge connecting the current tree to a new vertex. The goal is to minimize the total weight needed to connect every vertex, rather than to minimize each route from a chosen source.[ref]
His paper motivated the problem through communication, distribution and transportation networks, including leased communication lines. Its opening map connects Washington and the then forty-eight state capitals. That application shows how a geometric network-design question becomes a reusable optimization problem on a graph.[ref]
Shortest Connection Networks and Some Generalizations by Robert C. Prim. Page 1389 and figure 1
Articles by others on the same topic
Robert C. Prim is not widely recognized in popular culture, science, or history, so it's possible you might be referring to a specific individual within a niche context or a regional reference. If you have more context or details regarding the person or field in which they are involved, I can provide more focused information.